Liveness and fairness in process-algebraic verification

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

Volumn 2154, Issue , 2001, Pages 202-217

  Puhakka, Antti ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; SEMANTICS;

ALGEBRAIC METHOD; CLASSICAL MODEL; COMPOSITIONALITY; FAIRNESS PROPERTIES; IN-PROCESS; LIVENESS PROPERTIES; PROCESS ALGEBRAS; SEMANTIC EQUIVALENCES;

ALGEBRA;

EID: 84944036505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_14     Document Type: Conference Paper

References (29)

1. Alpern, B. & Schneider, F. B.: “Defining Liveness”. Information Processing Letters, Vol. 21 (No. 4), 1985, North-Holland.
2. Apt, K., Francez, N. & Katz, S.: “Appraising fairness in languages for distributed programming”. Distributed Computing (1988) Vol. 2 (No. 4), Springer-Verlag, pp. 226–241.
3. Bartlett, K. A., Scantlebury, R. A. & Wilkinson, P. T.: “A Note on Reliable Full- Duplex Transmission Over Half-Duplex Links”, Communications of the ACM 12 (5) 1969, pp. 260–261.
4. Bergstra, J. A., Klop, J. W.: “Verification of an Alternating Bit Protocol by Means of Process Algebra”. Mathematical Methods of Specification and Synthesis of Software Systems’85, Lecture Notes in Computer Science 215, Springer-Verlag 1985, pp. 9–23.
5. Brinksma, E., Rensink, A. & Vogler, W.: “Fair Testing”. CONCUR’95, Sixth International Conference on Concurrency Theory, Lecture Notes in Computer Science 962, Springer-Verlag 1995, pp. 313–327.
6. Clarke, E. M. & Emerson, E. A.: “Synthesis of Synchronization Skeletons for Branching Time Temporal Logic”. Proc. Logic in Programs: Workshop, 1981, Lecture Notes in Computer Science 131, Springer-Verlag 1981, pp. 52–71.
7. Cleaveland, R. & Lüttgen, G.: “A Semantic Theory for Heterogeneous System Design”. Proc. Foundations of Software Technology and Theoretical Computer Science 2000. Lecture Notes in Computer Science 1974, Springer-Verlag 2000, pp. 312–324.
8. Costa, G. & Stirling, C.: “A Fair Calculus of Communicating Systems”. Acta Informatica 21 (1984), Springer-Verlag, pp. 417–441.
9. Costa, G. & Stirling, C.: “Weak and Strong Fairness in CCS”. Proc. Mathematical Foundations of Computer Science 1984, Lecture Notes in Computer Science 176, Springer-Verlag 1984, pp. 245–254.
10. Davies, J. & Schneider, S.: “Using CSP to Verify a Timed Protocol over a Fair Medium”. Proc. CONCUR’92, Third International Conference on Concurrency Theory, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 355–369.
11. Francez, N.: “Fairness”. Springer-Verlag 1986, 295 p.
12. Hennessy, M.: “Axiomatising Finite Delay Operators”. Acta Informatica 21 (1) 1984, Springer-Verlag, pp. 61–88.
13. Hennessy, M.: “An Algebraic Theory of Fair Asynchronous Communicating processes”. Theoretical Computer Science 49 (1987), North-Holland, pp. 121–143.
14. 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.
15. Lamport, L.: “Proving the Correctness of Multiprocess Programs”. IEEE Transactions on Software Engineering, Vol. SE-3 (No. 2) 1977, IEEE Computer Society, pp. 125–143.
16. Lamport, L.: “The Temporal Logic of Actions”. ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 16 (No. 3) 1994, pp. 872–923.
17. Lehmann, D., Pnueli, A. & Stavi, J.: “Impartiality, Justice and Fairness: The Ethics of Concurrent Termination”. Proc. Eighth International Colloquium on Automata, Languages and Programming 1981, Lecture Notes in Computer Science 115, Springer-Verlag 1981, pp. 264–277.
18. Manna, Z. & Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Volume I: Specification. Springer-Verlag 1992, 427 p.
19. Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.
20. Parrow, J.: Fairness Properties in Process Algebra with Applications in Communication Protocol Verification. Ph.D. thesis, Uppsala University, Department of Computer Systems, 1985, 176 p.
21. Pnueli, A.: “A Temporal Logic of Concurrent Programs”. Theoretical Computer Science, 13, 1981, pp. 45–60.
22. Puhakka, A. & Valmari, A.: “Livelocks, Fairness and Protocol Verification”. Proc. World Computer Conference 2000, Conference on Software: Theory and Practice, International Federation for Information Processing (IFIP), pp. 471–479.
23. Puhakka, A. & Valmari, A.: “Liveness and Fairness in Process-Algebraic Verification”. To be published as Tampere University of Technology, Software Systems Laboratory Report 24, ISBN 952-15-0650-4.
24. Queille, J. P. & Sifakis, J.: “Specification and Verification of Concurrent Systems in CESAR”. Proc. Fifth International Symposium on Programming, 1981.
25. Roscoe, A. W.: The Theory and Practice of Concurrency. Prentice-Hall 1998, 565 p.
26. 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.
27. Valmari, A.: “Compositionality in State Space Verification Methods”. Proc. Application and Theory of Petri Nets 1996, Lecture Notes in Computer Science 1091, Springer-Verlag 1996, pp. 29–56.
28. Valmari, A., Kemppainen, J., Clegg, M. & Levanto, M.: “Putting Advanced Reachability Analysis Techniques Together: the’ARA’ Tool”. Proc. Formal Methods Europe’93, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597–616.
29. Valmari, A. & Tienari, M.: “Compositional Failure-Based Semantic Models for Basic LOTOS”. Formal Aspects of Computing (1995) 7: 440–468.