Deciding global partial-order properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 41-52

  Alur, Rajeev ^a   McMillan, Ken ^b   Peled, Doron ^c  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SEMANTICS; SET THEORY; TEMPORAL LOGIC;

ASYNCHRONOUS SYSTEM; DECISION PROCEDURE; GLOBAL CONFIGURATION; MODEL CHECKING PROBLEM; PARTIAL ORDER SEMANTICS; PARTIALLY ORDERED SET; REDUCTION ALGORITHMS; STATE SPACE SEARCH;

MODEL CHECKING;

EID: 84878529669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055039     Document Type: Conference Paper

References (17)

1. R. Alur, W. Penczek, and D. Peled. Model-checking of causality properties. 10th Symposium on Logic in Computer Science, 90-100, 1995.
2. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Workshop on Logic of Programs, LNCS 131, 52-71, 1981.
3. W. Ebinger. Logical definability of trace languages. In V. Diekert, G. Rozenberg (Eds.) The Book of Traces, World Scientific, 382-390, 1995.
4. J. Esparza. Model checking using net unfolding. Science of Computer Programming 23, 1994.
5. P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation 110 (2), 305-326, 1994.
6. S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science 75, 21-43, 1992.
7. K. Lodaya, R. Parikh, R. Ramanujam, and P.S. Thiagarajan. A logical study of distributed transitions systems. Information and Computation 119, 91-118, 1985.
8. A. Mazurkiewicz. Trace Theory. In W. Brauer, W. Reisig, G. Rozenberg (eds.), Advances in Petri Nets 1986, LNCS 255, 279-324, 1987.
9. K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Fourth C4V, LNCS 663, 164-177, 1992.
10. D. Peled. Combining partial order reductions with on-the-fly model checking. Sixth Conferenceon Computer Aided Verification, LNCS 818, 377-390, 1994.
11. W. Penczek. On undecidability of propositional temporal logics on trace systems. Information Processing Letters 43, 147-153, 1992.
12. V.R. Pratt. Modeling concurrency with partial orders. Intl. J. of Parallel Programming 15 (1), 33-71, 1986.
13. P.S. Thiagarajan. A trace based extension of linear time temporal logic. Ninth Symposium on Logic in Computer Science, 1994.
14. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. 12th Symposium on Logic in Computer Science, 1997.
15. A. Valmari. A Stubborn attack on state explosion. Proc. 2nd Conference on Computer-Aided Verification, LNCS 531, 156-165, 1990.
16. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. First Symposium on Logic in Computer Science, 332-344, 1986.
17. I. Walukiewicz. Difficult configurations - on the complexity of LTrL. 25th International Colloquium on Automata, Languages, and Programming, 1998.