A generalised sweep-line method for safety properties

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

Volumn 2391, Issue , 2002, Pages 549-567

  Kristensen, Lars Michael ^a   Mailund, Thomas ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Explicit state space exploration methods; Practical use and tool support; Reachability analysis; State space reduction methods; Theoretical foundations

Indexed keywords

SPACE RESEARCH;

EXPLICIT STATE SPACE EXPLORATIONS; REACHABILITY ANALYSIS; STATE-SPACE REDUCTION; THEORETICAL FOUNDATIONS; TOOL SUPPORT;

FORMAL METHODS;

EID: 84937395593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45614-7_31     Document Type: Conference Paper

References (27)

1. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.
2. R. Carvajal-Schiaffino, G. Delzanno, and G. Chiola. Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets. In Proceedings of TACAS 2001, volume 2031 of LNCS, pages 435–449. Springer-Verlag, 2001.
3. S. Christensen and J.B. Jørgensen. Analysis of Bang and Olufsen’s BeoLink Audio/Video System Using Coloured Petri Nets. In Proceedings of ICATPN’97, volume 1248 of LNCS, pages 387–406. Springer-Verlag, 1997.
4. S. Christensen, J.B. Jørgensen, and L.M. Kristensen. Design/CPN - A Computer Tool for Coloured Petri Nets. In Proceedings of TACAS’97, volume 1217 of LNCS, pages 209–223. Springer-Verlag, 1997.
5. S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proceedings of TACAS 2001, volume 2031 of LNCS, pages 450–464. Springer-Verlag, 2001.
6. E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. FormalMetho ds in System Design, 9(1/2):77–104, 1996.
7. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. FormalMetho ds in System Design, 9(1/2):105–131, 1996.
8. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems, An Approach to the State-Explosion Problem, volume 1032 of LNCS. Springer- Verlag, 1996.
9. S. Gordon, L.M. Kristensen, and J. Billington. Verification of a Revised WAP Wireless Transaction Protocol. In Proceedings of ICATPN 2002, LNCS. Springer- Verlag, 2002. To appear.
10. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.
11. G.J. Holzmann. An Analysis of Bitstate Hashing. FormalMetho ds in System Design, 13(3):287–305, 1998.
12. C. Jard and T. Jeron. Bounded-memory Algorithms for Verification On-the-fly. In Proceedings of CAV’91, volume 575 of LNCS, pages 192–202. Springer-Verlag, 1991.
13. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1: Basic Concepts. Monographs in Theoretical Computer Science. Springer-Verlag, 1992.
14. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 2: Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1994.
15. K. Jensen. Condensed State Spaces for Symmetrical Coloured Petri Nets. Formal Methods in System Design, 9(1/2):7–40, 1996.
16. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and PracticalUse. Volume 3: PracticalUse. Monographs in Theoretical Computer Science. Springer-Verlag, 1997.
17. S. Katz and H. Miller. Saving Space by Fully Exploiting Invisible Transitions. FormalMetho ds in System Design, 14(3):311–332, 1999.
18. L. M. Kristensen and A. Valmari. Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. In Proceedings of ICATPN’98, volume 1420 of LNCS, pages 104–123. Springer-Verlag, 1998.
19. L.M. Kristensen, S. Christensen, and K. Jensen. The Practitioner’s Guide to Coloured Petri Nets. InternationalJournalon Software Tools for Technology Transfer, 2(2):98–132, 1998.
20. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
21. A.N. Parashkevov and J. Yantchev. Space Efficient Reachability Analysis Through Use of Pseudo-Root States. In Proceedings of TACAS’97, volume 1217 of LNCS, pages 50–64. Springer-Verlag, 1997.
22. D. Peled. All from One, One for All: On Model Checking Using Representatives. In Proceedings of CAV’93, volume 697 of LNCS, pages 409–423. Springer-Verlag, 1993.
23. J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.
24. A. Valmari. A Stubborn Attack on State Explosion. In Proceedings of CAV’90, volume 531 of LNCS, pages 156–165. Springer-Verlag, 1990.
25. A. Valmari. The State Explosion Problem. In Lectures on Petri Nets I: Basic Models, volume 1491 of LNCS, pages 429–528. Springer-Verlag, 1998.
26. M. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In In Proc. of IEEE Symposium on Logic in Computer Science, pages 322–331, 1986.
27. P. Wolper and P. Godefroid. Partial Order Methods for Temporal Verification. In Proceedings of CONCUR’93, volume 715 of LNCS. Springer-Verlag, 1993.