Visual verification of safety and liveness

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

Volumn 1051, Issue , 1996, Pages 228-247

  Valmari, Antti ^a   Setälä, Manu ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Labelled transition system; Process algebra; Reduction; Verification

Indexed keywords

PHILOSOPHICAL ASPECTS; REDUCTION; VERIFICATION;

COMPUTER AIDED; COMPUTER SCREENS; LABELLED TRANSITION SYSTEMS; PROCESS ALGEBRAS; RAPID FEEDBACK; REACTIVE SYSTEM; SYSTEM DESIGNERS; VISUAL VERIFICATION;

FORMAL METHODS;

EID: 84955610782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60973-3_90     Document Type: Conference Paper

References (25)

1. Bochmann, G. v.: Usage of Protocol Development Tools: The Results of a Survey. Proceedings of the 7th International Symposium on Protocol Specification, Testing and Verification (1987), North-Holland 1988.
2. Bolognesi, T. & Brinksma, E.: Introduction to the ISO Specification Language LOTOS. Computer Networks and ISDN Systems 14 1987 pp. 25-59. Also in: The Formal Description Technique LOTOS, North-Holland 1989, pp. 23-73.
3. Brookes, S. D. & Roscoe, A. W.: An Improved Failures Model for Communicating Processes. Proceedings of the NSF-SERC Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, 1985, pp. 281-305
4. Cheung, S. C. & Kramer, J.: Enhancing Compositional Reachability Analysis with Context Constraints. Proceedings of the first ACM SIGSOFI" Symposium on the Foundations of Software Engineering, ACM Software Engineering Notes, 18(5) 1993, pp. 115-125.
5. Craigen, D., Gerhart, S. & Ralston, T.: Formal Methods Reality Check: Industrial Usage. Proceedings of Formal Methods Europe '93, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 250-267.
6. Eloranta, J.: Minimal Transition Systems with Respect to Divergence Preserving Behavioural Equivalences. Doctoral thesis, University of Helsinki, Department of Computer Science, Report A-1994-1, Helsinki, Finland 1994, 162 p.
7. Feldbrugge, F.: Petri Net Tool Overview 1992. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 169-209.
8. Formal Systems (Europe) Ltd.: Failures Divergence Refinement User Manual and Tutorial, version 1.4 1994.
9. Graf, S. & Steffen, B.: Compositional Minimization of Finite State Processes. Computer- Aided Verification '90 (Proceedings of a workshop), AMS-ACM DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 3, American Mathematical Society 1991, pp. 57-73.
10. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p.
11. Inverardi, P. & Priami, C.: Evaluation of Tools for the Analysis of Communicating @stems. EXFCS Bulletin 45, October 1991, pp. 158-185.
12. ISO 8807 International Standard: Information processing systems - Open Systems Interconnection - LOTOS -A formal description technique based on the temporal ordering of observational behaviour. International Organization for Standardization 1989, 142 p.
13. Kaivola, R. & Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. Proceedings of CONCUR '92, Lecture Notes in Computer Science 630, Springer-Verlag 1992, pp. 207-221.
14. Madelaine, E. & Vergamini, D.: AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks. Formal Description Techniques II (Proceedings of FORTE '89), North-Holland 1990, pp. 61-66.
15. Milner, R.: Communication and Concurrency. Prentice-Hall 1989, 260 p.
16. Peterson, G. L.: Myths about the Mutual Exclusion Problem. Information Processing Letters 12 (3) 1981, pp. 115-116.
17. Settle, M. & Valmari, A.: Validation and Verification with Weak Process Semantics. Proceedings of Nordic Seminar on Dependable Computing Systems 1994, Lyngby, Denmark, August 1994, pp. 15-26.
18. Valmari, A. &Tienari, M.: An lmproved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. Protocol Specification, Testing and Verification XI (Proceedings of PSTV '91), North-Holland 1991, pp. 3-18.
19. Valmari, A.: Compositional State Space Generation. Advances in Petri Nets 1993, Lecture Notes in Computer Science 674, Springer-Verlag 1993, pp. 427-457. (Earlier version in Proceedings of the 11 th International Conference on Application and Theory of Petri Nets, Paris, France 1990, pp. 43-62.)
20. Valmari, A., Kemppainen, J., Clegg, M. & Levanto, M.: Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. Proceedings of Formal Methods Europe '93, Lecture Notes in Computer Science 670, Springer-Verlag 1993, pp. 597-616.
21. Valmari, A.: State of the Art Report: Stubborn Sets. Petri Net Newsletter 46, April 1994, pp. 6-14.
22. Valmari, A.: Failure-based Equivalences Are Faster Than Many Believe. Structures in Concurrency Theory, Proceedings, Berlin, Germany, May 1995, Springer-Verlag "Workshops in Computing" series 1995, pp. 326-340.
23. Valmari, A. & Tienari, M.: Compositional Failure-based Semantic Models for Basic LOTOS. Formal Aspects of Computing (1995) 7: 440-468.
24. Valmari, A., Karsisto, K. & Setälä, M.: Visualisation of Reduced Abstracted Behaviour as a Design Tool. To appear in Proceedings of Fourth Euromicro Workshop on Parallel and Distributed Processing, Braga, Portugal, Jan. 1996, IEEE publ., 8 p.
25. Wolper, P. & Godefroid, P.: Partial-Order Methods for Temporal Verification. Proceedings of CONCUR '93, Lecture Notes in Computer Science 715, Springer-Verlag 1993, pp. 233-246.