Attacking symbolic state explosion

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

Volumn 2102, Issue , 2001, Pages 298-310

  Delzanno, Giorgio ^a   Raskin, Jean François ^b   Van Begin, Laurent ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; GRAPHIC METHODS; PETRI NETS; VECTORS;

ASSERTIONAL LANGUAGES; BACKWARD REACHABILITY; CONCURRENT SYSTEMS; PARAMETERIZED SYSTEM; SYMBOLIC MODEL CHECKING; SYMBOLIC REPRESENTATION; VECTOR ADDITION SYSTEMS; VERIFICATION TOOLS;

MODEL CHECKING;

EID: 84958760370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_28     Document Type: Conference Paper

References (26)

1. M. Ajmone Marsan, G. Balbo, G. Conte, S. Donatelli and G. Franceschinis. Modelling with Generalized Stochastic Petri Nets. Series in Parallel Computing. John Wiley & Sons, 1995.
2. P. A. Abdulla and A. Nylen. Better is Better than Well: On Ecient Verifcation of Infnite-State Systems. In Proc. LICS 2000, pages 132-140, 2000.
3. P. A. Abdulla, K. Cerans, B. Jonsson and Y.-K. Tsay. General Decidability Theorems for Infnite-State Systems. In Proc. LICS '96, pages 313-321, 1996.
4. T. Ball, S. Chaki, S. K. Rajamani. Parameterized Verifcation of Multithreaded Software Libraries. MSR Technical Report 2000-116. In Proc. TACAS 2001, LNCS 2031, pages 158-173, 2001.
5. G. Behrmann, K. G. Larsen, J. Pearson, C. Weise, and W. Yi. Ecient Timed Reachability Analysis Using Clock Dierence Diagrams. In Proc. CAV '99, LNCS 1633, pages 341-353, 1999.
6. B. Berard and L. Fribourg. Reachability analysis of (timed) Petri nets using real arithmeti In Proc. CONCUR '99, LNCS 1664, pages 178-193, 1999.
7. A. Bouajjani, and R. Mayr. Model Checking Lossy Vector Addition Systems. In Proc. STACS '99, LNCS 1563, pages 323-333, 1999.
8. T. Bultan. BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems. In Proc. TACAS 2000, LNCS 1785, pages 441-455, 2000.
9. T. Bultan, R. Gerber, and W. Pugh. Symbolic Model Checking of Infnitestate Systems using Presburger Arithmetics. In Proc. CAV '97, LNCS 1254, pages 400-411, 1997.
10. G. Chiola, G. Franceschinis, R. Gaeta, and M. Ribaudo. GreatS PN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets. Per- formance Evaluation, 24(1-2), pages 47-68, 1995.
11. G. Delzanno. Automatic Verifcation of Parameterized Cache Coherence Protocols. In Proc. CAV 2000, LNCS 1855, pages 53-68, 1996.
12. G. Delzanno, J. Esparza, and A. Podelski. Constraint-based Analysis of Broadcast Protocols. In Proc. CSL '99, LNCS 1683, pag. 50-66, 1999.
13. G. Delzanno, and J. F. Raskin. Symbolic Representation of Upward-closed Sets. In Proc. TACAS 2000, LNCS 1785, pages 426-440, 2000.
14. E. A. Emerson and K. S. Namjoshi. On Model Checking for Nondeterministic Infnite-state Systems. In Proc. LICS '98, pages 70-80, 1998.
15. J. Esparza, A. Finkel, and R. Mayr. On the Verifcation of Broadcast Protocols. In Proc. LICS '99, pages 352-359, 1999.
16. J. Esparza and S. Melzer. Verifcation of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16:159-189, 2000.
17. A. Finkel. The minimal coverability graph for Petri nets. In In Advances in Petri Nets '93, LNCS 674, pages 210-243. Springer, 1993.
18. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
19. S. M. German, A. P. Sistla. Reasoning about Systems with Many Processes. JACM 39(3): 675-735 (1992)
20. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: a Model Checker for Hybrid Systems. In Proc. CAV '97, LNCS 1254, pages 460-463, 1997.
21. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In Proc. CAV '97, LNCS 1254, pages 424-435, 1997.
22. A. Miner, and G. Ciardo. Ecient Reachability Set Generation and Storage using Decision Diagrams. In Proc. of ICATPN '99, pages 6-25, 1999.
23. E. Pastor, J. Cortadella, M. A. Pena. Structural Methods to Improve the Symbolic Analysis of Petri Nets. In Proc. ICATPN '99, LNCS 1639, pages 26-45. Springer, 1999.
24. W. Reisig. Petri Nets. An introduction. EATCS Monographs on Theoretical Computer Science, Springer 1986.
25. M. Silva, E. Teruel, and J. M. Colom. Linear Algebraic and Linear Programming Techniques for Analysis of Place/Transition Net Systems. In W. Reisig and G. Rozenberg, editors. Lectures on Petri Nets I: Basic Models. Advances in Petri Nets, LNCS 1491, pages 308-309. Springer, 1998.
26. D. Zampunieris, and B. Le Charlier. Ecient Handling of Large Sets of Tuples with Sharing Trees. In Proceedings of the Data Compressions Conference (DCC'95), 1995.