All from one, one for all: On model checking using representatives

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

Volumn 697 LNCS, Issue , 1993, Pages 409-423

  Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; EQUIVALENCE CLASSES; SET THEORY;

EQUIVALENCE RELATIONS; FINITE STATE PROGRAM; LINEAR TEMPORAL LOGIC; MODEL CHECKING ALGORITHM; REDUCED-STATE; SPACE AND TIME; STATE GRAPHS;

MODEL CHECKING;

EID: 85010991128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_34     Document Type: Conference Paper

References (16)

1. B. Alpern, F.B. Schneider, Defining liveness, Information Processing Letters 21 (1985), 181-185.
2. K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, Vol 2 (1988), 226-241.
3. P. Godefroid, Using partial orders to improve automatic verification methods, CAV’90, DIMACS Series, Vol 3, 1991, 321-339.
4. P. Godefroid, P. Wolper, Using partial orders for the efficient verification of dead-lock freedom and safety properties, CAV’91, Aalborg, Denmark, 1991, LNCS 575, Springer-Verlag, 332-342.
5. S. Katz, D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Computing 6 (1992), 107-120, A preliminary version, titled An efficient verification method for parallel and distributed programs, appeared in: Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, The Netherlands, 1988, LNCS 354, Springer-Verlag, 489-507.
6. S. Katz, D. Peled, Defining conditional independence using collapses, Theoretical Computer Science 101 (1992), 337-359, a preliminary version appeared in BCS-FACS Workshop on Semantics for Concurrency, Leicester, England, July 1990, Springer-Verlag, 262-280.
7. M. Z. Kwiatkowska, Fairness for non-interleaving concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.
8. O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification, 11th ACM POPL, 1984, 97-107.
9. Z. Manna, A. Pnueli, How to cook a temporal proof system for your pet language. 9th ACM POPL, Texas, 1983, 141-151.
10. A. Mazurkiewicz, Trace semantics, in: W. Brauer, W. Reisig, G. Rozenberg (eds.) Advances in Petri Nets 1968, Bad Honnef, LNCS 255, Springer-Verlag, 1987, 279-324.
11. W.T. Overman, Verification of concurrent systems: function and timing, Ph.D. dissertation, University of California at Los Angeles 1981, 174p.
12. D. Peled, ’sometimes’ sometimes is as good as ‘always’, CONCUR’92, Stony Brook, NY, USA, August 1992, LNCS 630, Springer-Verlag 1992, 192-206.
13. D. Peled, A. Pnueli, Proving partial order liveness properties, 17th ICA7P, LNCS 443, Springer-Verlag, 1990, 553-71.
14. W. Reisig, Petri Nets: An Introduction, EATCS Monographs on Theoretical Computer Science, Springer-Verlag 1985.
15. A. Valmari, Stubborn sets for reduced state space generation, 10th International Conference on Application and Theory of Petri Nets, Vol. 2, 1-22, Bonn, 1989.
16. A. Valmari, A Stubborn attack on state explosion, CAV’90, DIMACS Series, Vol 3, 1991, 25-42.