Analyzing fair parametric extended automata

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

Volumn 2126 LNCS, Issue , 2001, Pages 335-355

  Bouajjani, Ahmed ^b   Collomb Annichini, Aurore ^a   Lakhnech, Yassine ^a   Sighireanu, Mihaela ^b  

^a VERIMAG   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; STATIC ANALYSIS;

ABSTRACT MODELING; ACCELERATION TECHNIQUE; COUNTER AUTOMATA; FINITE ABSTRACTION; INFINITE STATE SYSTEMS; LIVENESS PROPERTIES; ORIGINAL MODEL; SYMBOLIC REACHABILITY ANALYSIS;

AUTOMATA THEORY;

EID: 29144455136     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47764-0_19     Document Type: Conference Paper

References (18)

1. P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In Proceedings of 5th TACAS, Volume 1579 of LNCS. Springer Verlag, 1999.
2. P. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling global conditions in parametrized system verification. In Proceedi ngs of 11th C AV, Volume 1633 of LNCS. Springer Verlag, 1999.
3. P.A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy, FIFO channels. In Proceedings of the 10th C AV, Volume 1427 of LNCS, pages 305-317. Springer Verlag, 1998.
4. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126: 183-235, 1994.
5. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In E.A. Emerson and A.P. Sistla, editors, Proceedings of the 12th C AV, Volume 1855 of LNCS, pages 419-434. Springer Verlag, July 2000.
6. K. Baukus, Y. Lakhnech, and K. Stahl. Verifying universal properties of parameterized networks. In Proceedi ngs of FT RTFT, 2000.
7. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of qdds. In Proceedi ngs of SAS'97, Volume 1302 of LNCS. Springer Verlag, 1997.
8. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proceedi ngs of the 6th CAV, Volume 818 of LNCS. Springer Verlag, 1994.
9. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In Proceedings of IC ALP'97, LNCS. Springer Verlag, 1997.
10. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In E.A. Emerson and A.P. Sistla, editors, Proceedings of the 12th C AV, Volume 1855 of LNCS, pages 403-418, July 2000.
11. M. Colon and H. Sipma. Synthesis of linear ranking functions. In Proceedings of TACAS'01, 2001.
12. D. Dams, R. Gerth, and O. Grumberg. A heuristic for the automatic generation of ranking functions. In Proceedi ngs of WAVe, pages 1-8, 2000.
13. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Proceedi ngs of the 1st CAV, Volume 407 of LNCS, pages 197-212. Springer Verlag, 1989.
14. R.W. Floyd. Assigning meanings to programs. In In. Proc. Symp. on Appl. Math. 19, pages 19-32. American Mathematical Society, 1967.
15. A.C. Hearn. REDUCE - User's and Contributed Packages Manual. Codemist Ltd., February 1999. version 3.7.
16. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Computer Science, 83(1): 97-130, 1991.
17. Omega Team. The Omega Library, November 1996. version 1.1.0.
18. A. Pnueli and E. Shahar. Liveness and acceleration in parametrized verification. In Proceedi ngs of the 12th C AV, Volume 1855. Springer Verlag, 2000.