Abstracting WS1S systems to verify parameterized networks

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

Volumn 1785 LNCS, Issue , 2000, Pages 188-203

  Baukus, Kai ^a   Bensalem, Saddek ^b   Lakhnech, Yassine ^b   Stahl, Karsten ^a  

^a UNIVERSITY OF KIEL   (Germany)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS;

ABSTRACT SYSTEMS; FINITE STATE PROCESS; FINITE STATE SYSTEMS; LIVENESS PROPERTIES; PARAMETERIZED; TRANSITION SYSTEM;

ABSTRACTING;

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

References (26)

1. P.A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling Global Conditions in Parameterized System Verification. In N. Halbwachs and D. Peled, editors, CAV '99, Volume 1633 of LNCS, pages 134-145. Springer, 1999.
2. K. Apt and D. Kozen. Limits for Automatic Verification of Finit-State Concurrent Systems. Information Processing Letters, 22(6):307-309, 1986. (Pubitemid 16589252)
3. M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, 1989.
4. J.R. Büchi. Weak Second-Order Arithmetic and Finite Automata. Z. Math. Logik Grund l. Math., 6:66-92, 1960.
5. E. Clarke, O. Grumberg, and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. In I. Lee and S. Smolka, editors, CONCUR '95: Concurrency Theory, LNCS. Springer, 1995.
6. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5), 1994.
7. *. In E.-R. Olderog, editor, Proceedi ngs of PROCOMET '94. North-Holland, 1994.
8. C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21-52, 1961.
9. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In 22nd ACM Symposium on Principles of Programming Languages, pages 85-94, 1995.
10. E. A. Emerson and K. S. Namjoshi. Automatic verification of parameterized synchronous systems. In 8th Conference on Computer Aided Verification, LNCS 1102, pages 87-98, 1996. (Pubitemid 126101272)
11. O. Grumberg, editor. Proceedings of CAV '97, Volume 1256 of LNCS. Springer, 1997.
12. S.M. German and A.P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992. (Pubitemid 23600392)
13. S. Graf and H. Saidi. Construction of Abstract State Graphs with PVS. In Grumberg [Gru97].
14. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic Second-Order Logic in Practice. In TACAS '95, Volume 1019 of LNCS. Springer, 1996.
15. N. Halbwachs, F. Lagnier, and C. Ratel. An experience in proving regular networks of processes by modular model checking. Acta Informatica, 22(6/7), 1992.
16. R.P. Kurshan and K. McMillan. A structural induction theorem for processes. In ACM Symp. on Principles of Distributed Computing, Canada, pages 239-247, Edmonton, Alberta, 1989.
17. N. Klarlund and A. Møller. MONA Version 1.3 User Manual. BRICS, 1998.
18. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Grumberg [Gru97], pages 424-435.
19. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1), 1995.
20. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In POPL '97, Paris, 1997.
21. Z. Manna and A. Pnueli. Verification of parameterized programs. In E. Borger, editor, Specification and Validation Methods, pages 167-230, Oxford University Press, 1994.
22. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems, Safety. Springer Verlag, 1995.
23. Z. Stadler and O. Grumberg. Network grammars, communication behaviours and automatic verification. In Proc. Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, pages 151-165, Grenoble, France, 1989. Springer Verlag.
24. B.K. Szymanski. A simple solution to Lamport's concurrent programming problem with linear wait. In Proceedings of International Conference on Supercomputing Systems 1988, pages 621-626, St. Malo, France, July 1988.
25. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 134-191. Elsevier Science Publishers B. V., 1990.
26. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants (extended abstract). In Sifakis, editor, Workshop on Computer Aided Verification, LNCS 407, pages 68-80, 1989.