A sweep-line method for state space exploration

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

Volumn 2031 LNCS, Issue , 2001, Pages 450-464

  Christensen, Søren ^a   Kristensen, Lars Michael ^a,b   Mailund, Thomas ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MODELING LANGUAGES; SPACE RESEARCH; PETRI NETS;

COLOURED PETRI NETS; ON THE FLIES; ON-THE FLY VERIFICATION; SEQUENCE NUMBER; SPACE AND TIME; STATE SPACE EXPLORATION; STATE SPACE STORAGE; STATE-SPACE GENERATION; PETRI NET MODELS; SWEEP LINES;

PETRI NETS; SPACE RESEARCH;

EID: 84903134392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_31     Document Type: Conference Paper

References (22)

1. D. Bcrtsckas and R. Gallagcr. Data Networks. Prcnticc-Hall, Inc., 1992.
2. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677 691, 1986.
3. S. Christcnscn and J.B. Jørgcnscn. Analysis of Bang and Olufscn's BcoLink Audio/Video System Using Coloured Pctri Nets. In P. Azcma and G. Balbo, editors, 1. Proceedings of ICATPN'97, volume 1248 of Lecture Notes in Computer Science, pages 387 406. Springer-Vcrlag, 1997.
4. S. Christcnscn, J.B. Jørgcnscn, and L.M. Kristcnscn. Dcsign/CPN - A Computer Tool for Coloured Pctri Nets. In E. Brinksma, editor, Proceedings of TAGAS'97, volume 1217 of Lecture Notes in Computer Science, pages 209 223. Springcr-Vcrlag, 1997.
5. E.M. Clarke, R. Endcrs, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9, 1996.
6. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. Formal Methods in System Design, 9, 1996.
7. J. Esparza. Model Checking using Net Unfoldings. Science of Computer Programming, 23:151 195, 1994.
8. P. Godcfroid. Partial-Order Methods for the Verification of Concurrent Systems, An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer-Vcrlag, 1996.
9. G.J. Holzmann. Tracing protocols. AT&T Technical Journal, 64(10):2413 2433, December 1985.
10. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.
11. G.J. Holzmann. An Analysis of Bitstatc Hashing. Formal Methods in System Design, 13(3):287 305, November 1998. Extended and revised version of Proc. PSTV95, pp. 301-314.
12. C. Jard and T. Jcron. Bounded-memory Algorithms for Verification On-thc-fly. In Proceedings of CAV'91, volume 575 of Lecture Notes in Computer Science. Springer-Vcrlag, 1991.
13. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1, Basic Concepts. Monographs in Theoretical Computer Science. Springer-Vcrlag, 1992.
14. K. Jensen. Condensed State Spaces for Symmetrical Coloured Pctri Nets. Formal Methods in System Design, 9, 1996.
15. S. Katz and H. Miller. Saving Space by Fully Exploiting Invisible Transitions. Formal Methods in System Design, 14:311 332, 1999.
16. L.M. Kristcnscn, S. Christcnscn, and K. Jensen. The Practitioner's Guide to Coloured Pctri Nets. International Journal on Software Tools for Technology Transfer, 2(2):98 132, 1998.
17. K. L. McMillan. A Technique of State Space Search Based on Unfolding. Formal Methods in System Design, 6(1):45 65, 1995.
18. A. N. Parashkevov and J. Yantchev. Space Efficient Reachability Analysis Through Use of Pseudo-Root States. In Proceedings of TACAS'97, volume 1217 of Lecture Notes in Computer Science, pages 50 64. Springer-Vcrlag, 1997.
19. D. Pclcd. All from One, One for All: On Model Checking Using Representatives. In Proceedings of CAV'93, volume 697 of Lecture Notes in Computer Science, pages 409 423. Springer-Vcrlag, 1993.
20. J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.
21. A. Valmari. A Stubborn Attack on State Explosion. In Proceedings of CAV'9O, volume 531 of Lecture Notes in Computer Scienc, pages 156 165. Springer-Vcrlag, 1990.
22. P. Wolpcr and P. Godcfroid. Partial Order Methods for Temporal Verification. In Proceedings of CONCUR'93, volume 715 of Lecture Notes in Computer Science. Springer-Vcrlag, 1993.