Model checking of non-finite state processes by finite approximations

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

Volumn 1019, Issue , 1995, Pages 195-215

  de Francesco, N ^a   Fantechi, A ^a,b   Gnesi, S ^b   Inverardi, P ^c  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FINITE STATE PROCESS; FINITE-STATE TRANSITION SYSTEMS; INFINITE STATE; INFINITE STATE SYSTEMS; SAFETY PROPERTY; SEMI-DECISION PROCEDURES; TRANSITION SYSTEM; VERIFICATION METHODOLOGY;

MODEL CHECKING;

EID: 21844496694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60630-0_10     Document Type: Conference Paper

References (24)

1. J. C. M. Baeten, J. A. Bergstra, J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of ACM 40,3,1993, pp. 653-682.
2. G. Bruns. A practical technique for process abstraction. CONCUR’93, LNCS 715, pp. 37-49.
3. A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, n.54, October 1994, pp.207-223.
4. O. Burkart, B. Steffen. Pushdown processes: Parallel Composition and Model Checking. Proceedings, CONCUR. 94, LNCS 836, 1994, pp.98-113.
5. E.M. Clarke, E.A. Emerson, A.P. Sistla. Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications. ACM Toplas, 8 (2), 1986, pp. 244-263.
6. E.M Clarke, O Grumberg, D.E Long. Model Checking and Abstraction. ACM Toplas, 16 (5), 1994, pp.1512-1542.
7. R. Cleaveland, J. Parrow, B. Stetfen. The Concurrency Workbench. Proceedings of Automatic Verification Methods for Finite State Systems. Lecture Notes in Computer Science 407, Springer-Verlag, 1990, pp. 24-37.
8. D Dams, O Grumberg, R Gerth. Automatic Verification of Abstract Interpretation of l~.eactive Systems: Abstractions Preserving ∀CTL*, ∃CTL*, CTL*. IFIP working conference on Programming Concepts, Methods and Calculi (PROCOMET’94), 1994.
9. N. De Francesco, P. Inverardi. Proving Finiteness of CCS Processes by Non-standard Semantics. Acta Informatica, 31 (1), 1994, pp. 55-80.
10. R. De Nicola, A. Fantechi, S. Gnesi, G. RJstori. An action-based framework for verifying logical and behavioural properties of concurrent systems. Computer Network and ISDN systems, Vol. 25, No.7, 1993, pp 761-778.
11. R. De Nicola, F. W. Vaandrager. Action versus State based Logics for Transition Systems. Proceedings Ecole de Printemps on Semantics of Concurrency. LNCS 469, 1990, pp. 407-419.
12. J.C. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. R odriguez, J. Sifakis, A Toolbox for the Verification of LOTOS Programs. 14th ICSE, Melbourne, 1992, pp. 246-261.
13. J.C. Fernandez, L. Mounier. Verifying Bisimulations "On the Fly". Formal Description Techniques, III, Elsevier Science Publisher, pp. 95-110, 1991.
14. J. C. Godskesen, K. G. Larsen, M. Zeeberg. TAV Users Manual. Internal Report, Aalborg University Center, Denmark, 1989.
15. M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32, 1985, pp. 137-161.
16. H. Hungar, B. Steffen. Local Model Checking for Context-Free Processes. Proceedings, ICALP 93, LNCS 700, 1993, pp.593-605
17. H. Hungar. Local Model Checking for Parallel Composition of Context-Free Processes. Proceedings, CONCUR 94, LNCS 836, 1994, pp.114-128.
18. H. Huttel, C Stifling. Actions speak louder than words: Proving Bisimilarity for Context Free Processes. LICS 91, IEEE Computer Society Press, 1991, pp. 376-386.
19. E. Kindler. Safety and Liveness Properties: A Survey. Bulletin of the EATCS, 53, 1994, pp.268-272.
20. [201 E. Madelaine. Verification Tools from the Concur Project. Bulletin of EATCS 47, 1992, pp. 110-120.
21. E. Madelaine, D. Vergamini. AUTO: A Verification Tool for Distributed Systems Using Reduction of Finite Automata Networks. FORTE ’89, North-Holland, 1990, pp. 61-66.
22. Z. Manna, A. Pnueli. The Anchored Version of the Temporal Framework, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science 354, Springer-Verlag, 1989, pp. 201-284.
23. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
24. D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. LNCS 369, 1989.