Skip to main content
SpringerLink
Log in
Book cover

International Symposium of Formal Methods Europe

FME 2002: FME 2002:Formal Methods—Getting IT Right pp 549–567Cite as

A Generalised Sweep-Line Method for Safety Properties

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2391))

Abstract

The recently developed sweep-line method exploits progress present in many concurrent systems to explore the full state space of the system while storing only small fragments of the state space in memory at a time. A disadvantage of the sweep-line method is that it relies on a monotone and global notion of progress. This prevents the method from being used for many reactive systems. In this paper we generalise the sweep-line method such that it can be used for verifying safety properties of reactive systems exhibiting local progress. The basic idea is to relax the monotone notion of progress and to recognise the situations where this could cause the state space exploration not to terminate. The generalised sweep-line method explores all reachable states of the system, but may explore a state several times. We demonstrate the practical application of the generalised sweep-line method on two case studies demonstrating a reduction in peak memory usage to typically 10 % compared to the use of ordinary full state spaces.

Supported by the Danish Natural Science Research Council.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.E. Bryant. Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.

    Article  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  6. E.M. Clarke, R. Enders, T. Filkorn, and S. Jha. Exploiting Symmetries in Temporal Logic Model Checking. Formal Methods in System Design, 9(1/2):77–104, 1996.

    Article  Google Scholar 

  7. E.A. Emerson and A.P. Sistla. Symmetry and Model Checking. Formal Methods in System Design, 9(1/2):105–131, 1996.

    Article  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  10. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International Editions, 1991.

    Google Scholar 

  11. G.J. Holzmann. An Analysis of Bitstate Hashing. Formal Methods in System Design, 13(3):287–305, 1998.

    Article  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  15. K. Jensen. Condensed State Spaces for Symmetrical Coloured Petri Nets. Formal Methods in System Design, 9(1/2):7–40, 1996.

    Article  Google Scholar 

  16. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 3: Practical Use. iMonographs in Theoretical Computer Science. Springer-Verlag, 1997.

    Google Scholar 

  17. S. Katz and H. Miller. Saving Space by Fully Exploiting Invisible Transitions. Formal Methods in System Design, 14(3):311–332, 1999.

    Article  Google Scholar 

  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.

    Google Scholar 

  19. L.M. Kristensen, S. Christensen, and K. Jensen. The Practitioner’s Guide to Coloured Petri Nets. International Journal on Software Tools for Technology Transfer, 2(2):98–132, 1998.

    Article  MATH  Google Scholar 

  20. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  23. J.D. Ullman. Elements of ML Programming. Prentice-Hall, 1998.

    Google Scholar 

  24. A. Valmari. A Stubborn Attack on State Explosion. In Proceedings of CAV’90, volume 531 of LNCS, pages 156–165. Springer-Verlag, 1990.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  27. P. Wolper and P. Godefroid. Partial Order Methods for Temporal Verification. In Proceedings of CONCUR’93, volume 715 of LNCS. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Information Engineering, University of South Australia, Mawson Lakes Campus, SA, 5095, Australia

    Lars Michael Kristensen

  2. Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200, Aarhus N, Denmark

    Thomas Mailund

Authors
  1. Lars Michael Kristensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Mailund
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information Technology, Uppsala University, P.O. Box 337, 751 05, Uppsala, Sweden

    Lars-Henrik Eriksson

  2. Software Verification Research Centre, The University of Queensland, Queensland, 4072, Australia

    Peter Alexander Lindsay

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kristensen, L.M., Mailund, T. (2002). A Generalised Sweep-Line Method for Safety Properties. In: Eriksson, LH., Lindsay, P.A. (eds) FME 2002:Formal Methods—Getting IT Right. FME 2002. Lecture Notes in Computer Science, vol 2391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45614-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45614-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43928-8

  • Online ISBN: 978-3-540-45614-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation