Expand, enlarge and check. . . made efficient

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 394-407

  Geeraerts, Gilles ^a   Raskin, Jean François ^a   Van Begin, Laurent ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PETRI NETS; THEOREM PROVING;

LOSSY CHANNELS; TRANSITION SYSTEMS;

PROBLEM SOLVING;

EID: 26444577420     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_38     Document Type: Conference Paper

References (14)

1. P. A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-state Systems. In Proc. of LICS'96, pages 313-321. IEEE, 1996.
2. Parosh Abdulla, Aurore Annichini, and Ahmed Bouajjani. Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol. In Proc. of TACAS'99, number 1579 in LNCS, pages 208-222. Springer-Verlag, 1999.
3. P. A. Abdulla, A. Collomb-Annichini, A. Bouajjani, and B. Jonsson. Using forward reachability analysis for verification of lossy channel systems. Form. Methods Syst. Des., 25(1):39-65, 2004.
4. G. Ciardo. Petri nets with marking-dependent arc multiplicity: properties and analysis. In Proc. of ICATPN'94, vol. 815 of LNCS, pages 179-198. Springer, 1994.
5. G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. of CAV 2001, vol. 2102 of LNCS, pages 298-310. Springer, 2001.
6. E. A. Emerson and K. S. Namjoshi. On Model Checking for Non-deterministic Infinite-state Systems. In Proc. of LICS '98, pages 70-80. IEEE, 1998.
7. J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. of LICS'99, pages 352-359. IEEE, 1999.
8. A. Finkel. The minimal coverability graph for Petri nets. In Proc. of APN'93, vol. 674 of LNCS, pages 210-243. Springer, 1993.
9. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
10. A. Finkel G. Geeraerts, J.-F. Raskin, and L. Van Begin. A counter-example to the minimal coverability tree algorithm Technical report ULB 535. http://www.ulb.ac.be/di/ssd/ggeeraer/papers/FGRV05-Coverability.pdf
11. G. Geeraerts, J.-F. Raskin, and L. Van Begin. Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS. In Proc. of FSTTCS'04, vol. 3328 of LNCS, pages 287-298. Springer-Verlag, 2004.
12. T. A. Henzinger, O. Kupferman, and S. Qadeer. From prehistoric to postmodern symbolic model checking. Formal Methods in System Design, 23(3):303-327, 2003.
13. Ph. Schnoebelen. Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity. Information Processing Letters, 83(5), 251-261, 2002
14. L. Van Begin. Efficient Verification of Counting Abstractions for Parametric systems. PhD thesis, Université Libre de Bruxelles, Belgium, 2003.