Obtaining memory-efficient reachability graph representations using the sweep-line method

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

Volumn 2988, Issue , 2004, Pages 177-191

  Mailund, Thomas ^a   Westergaard, Michael ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Memory efficient state representation; State space methods; State space reduction; The sweep line method; Verification

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS; VERIFICATION;

EXPLICIT STATE; MEMORY EFFICIENT; REACHABILITY GRAPHS; STATE REPRESENTATION; STATE VECTOR; STATE-SPACE REDUCTION; SWEEP LINES; THEORETICAL MINIMUM;

STATE SPACE METHODS;

EID: 35048870647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_16     Document Type: Article

References (34)

1. Design/CPN. Online http://www.daimi.au.dk/designCPN.
2. G. Behrmann, K.G. Larsen, and R. Pelánek. To Store or Not to Store. In W.A. Hunt and F. Somenzi, editors, Proc. of CAV 2003, volume 2725 of LNCS, pages 433-445. Springer, 2003.
3. J. Billington, M.C. Wilbur-Ham, and M.Y. Bearman. Automated protocol Verification. In Proc. of IFIP WG 6.1 5th International Workshop on Protocol Specification, Testing, and Verification, pages 59-70. Elsevier, 1985.
4. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
5. 20 States and Beyond. Information and Computation, 98(2):142-170, 1992.
6. S. Christensen, J.B. Jørgensen, and L.M. Kristensen. Design/CPN - A Computer Tool for Coloured Petri Nets. In Proc. of TACAS'97, volume 1217 of LNCS, pages 209-223. Springer-Verlag, 1997.
7. S. Christensen, L.M. Kristensen, and T. Mailund. A Sweep-Line Method for State Space Exploration. In Proc. of TACAS'01, volume 2031 of LNCS, pages 450-464. Springer-Verlag, 2001.
8. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
9. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, chapter 18.4, pages 367-375. The MIT Press, 1990.
10. J. Desel and W. Reisig. Place/Transition Petri Nets. In Lecture on Petri nets I: Basic Models, volume 1491 of LNCS, pages 122-173. Springer-Verlag, 1998.
11. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. Formal Methods in System Design, 9, 1996.
12. J. Geldenhuys and A. Valmari. A Nearly Memory-Optimal Data Structure for Sets and Mappings. In T. Ball and S.K. Rajamani, editors, Proc. of SPIN 2003, volume 2648 of LNCS, pages 136-150. Springer, 2003.
13. 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.
14. S. Gordon, L.M. Kristensen, and J. Billington. Verification of a Revised WAP Wireless Transaction Protocol. In Proc. of ICATPN'02, volume 2360 of LNCS, pages 182-202. Springer-Verlag, 2002.
15. G.J. Holzmann. An Improved Protocol Reachability Analysis Technique. Software, Practice and Experience, 18(2):137-161, 1988.
16. G.J. Holzmann. Algorithms for Automated Protocol Validation. AT&T Technical Journal, 69(2):32-44, 1990.
17. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.
18. G.J. Holzmann. State Compression in SPIN: Recursive Indexing and Compression Traning Runs. In Proc. of 3rd SPIN Workshop, 1997.
19. G.J. Holzmann. An Analysis of Bitstate Hashing. Formal Methods in System Design, 13:289-307, 1998.
20. G.J. Holzmann and A. Puri. A Minimized Automaton Representation of Reachable States. Journal on Software Tools for Technology Transfer, 2(3):270-278, 1999.
21. C.N. Ip and D.L. Dill. Better Verification Through Symmetry. Formal Methods in System Design, 9, 1996.
22. K. Jensen. Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use. Volume 1: Basic Concepts. Springer-Verlag, 1992.
23. K. Jensen. Coloured Petri Nets - Basic Concepts, Analysis Methods and Practical Use. Volume 2: Analysis Methods. Springer-Verlag, 1994.
24. L.M. Kristensen, S. Christensen, and K. Jensen. The Practitioner's Guide to Coloured Petri Nets. Journal on Software Tools for Technology Transfer, 2(2):98-132, 1998.
25. L.M. Kristensen and T. Mailund. A Generalised Sweep-Line Method for Safety Properties. In Proc. of FME'02, volume 2391 of LNCS, pages 549-567. Springer-Verlag, 2002.
26. T. Mailund. Sweeping the State Space - A Sweep-Line State Space Exploration Method. PhD thesis, Department of Computer Science, University of Aarhus, 2003.
27. M. Mäkelä. Condensed Storage of Multi-Set Sequences. In K. Jensen, editor, Proc. of Workshop on Practical Use of High-level Petri Nets, number DAIMI PB-547, pages 111-126. University of Aarhus, 2000.
28. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
29. D. Peled. All for One, One for All: On Model Checking Using Representatives. In Proc. of CAV'93, volume 697 of LNCS, pages 409-423. Springer-Verlag, 1993.
30. K. Schmidt. Using Petri Net Invariants in State Space Construction. In H. Garavel and J. Hatcliff, editors, Proc. of TACAS 2003, volume 2619 of LNCS, pages 473-488. Springer, 2003.
31. U. Stern and D.L. Dill. Improved Probabilistic Verification by Hash Compaction. In Correct Hardware Design and Verification Methods, volume 987 of LNCS, pages 206-224. Springer-Verlag, 1995.
32. J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.
33. A. Valmari. Stubborn Sets for Reduced State Space Generation. In Advances in Petri Nets '90, volume 483 of LNCS, pages 491-515. Springer-Verlag, 1990.
34. P. Wolper and D. Leroy. Reliable Hashing without Collision Detection. In Proc. of CAV'93, volume 697 of LNCS, pages 59-70. Springer-Verlag, 1993.