Weakest-congruence results for livelock-preserving equivalences

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

Volumn 1664 LNCS, Issue , 1999, Pages 510-524

  Puhakka, Antti ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC VERIFICATION; FAILURES-DIVERGENCES; VERIFICATION ALGORITHMS;

EQUIVALENCE CLASSES;

EID: 84888270544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_35     Document Type: Conference Paper

References (13)

1. Bergstra, J. A., Klop, J. W. & Olderog, E.-R.:"Failures without Chaos: A New Process Semantics for Fair Abstraction". Formal Description of Programming Concepts III, North-Holland 1987, pp. 77-103.
2. Brinksma, E., Rensink, A. & Vogler,W.: "Fair Testing". Proc. CONCUR '95, Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag 1995, pp. 313-327.
3. Brookes, S. D. & Roscoe, A. W.: "An Improved Failures Model for Communicating Sequential Processes". Proc. NSF-SERC Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag 1985, pp. 281-305.
4. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.
5. Kaivola, R. & Valmari, A.:"The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic". Proc. CONCUR '92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207-221.
6. Leduc, G.: "Failure-based Congruences, Unfair Divergences and New Testing Theory". Proc. Protocol Specification, Testing and Verification, XIV, Chapman & Hall, London (1995), pp. 252-267.
7. Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Volume I: Specification. Springer-Verlag 1992, 427 p.
8. Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.
9. Roscoe, A.W.: The Theory and Practice of Concurrency.Prentice-Hall 1998, 565 p.
10. Valmari, A.:"The Weakest Deadlock-Preserving Congruence". Information Processing Letters 53 (1995) 341-346.
11. Valmari, A.:"Failure-based Equivalences Are Faster Than Many Believe". Proc. Structures in Concurrency Theory 1995, Springer-Verlag "Workshops in Computing" series, 1995, pp. 326-340.
12. Valmari, A.: "The State Explosion Problem". Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science 1491, Springer-Verlag 1998, pp. 429-528.
13. Valmari, A. & Tienari, M.: "Compositional Failure-Based Semantic Models for Basic LOTOS". Formal Aspects of Computing (1995) 7: 440-468.