Skip to main content
SpringerLink
Log in

Designing a LTL Model-Checker Based on Unfolding Graphs

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 2000 (ICATPN 2000)

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

Included in the following conference series:

Abstract

In this paper, we present new technique designing to solve the on-the-fly model checking problem for linear temporal logic using unfolding graphs [4] and the two key algorithms presented in [2]. Our study is based on the recognition of stuttering behavior in a formula automaton and on the on-the-fly construction of an unfolding graph. Moreover, the characterization of different kinds of behaviors allows us to design efficient algorithms for the detection of accepting paths. We have extended our study to the use of the atomic proposition dead which holds for terminal states. Partial order techniques are not adapted to deal with this global property in the context of a LTL model checking.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Courcoubetis, M. Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275–288, 1992.

    Article  Google Scholar 

  2. J.-M. Couvreur. On-the-fly verification of linear temporal logic. In Proc. of FM’99, volume 1708 of Lecture Notes in Computer Science, pages 253–271. Springer Verlag, 1999.

    Google Scholar 

  3. J.-M. Couvreur and D. Poitrenaud. Model checking based on occurrence net graph. In Proc. of Formal Description Techniques IX, Theory, Applications and Tools, pages 380–395, 1996.

    Google Scholar 

  4. J.-M. Couvreur and D. Poitrenaud. Detection of illegal behaviours based on unfoldings. In Proc. of ICATPN’99, volume 1639 of Lecture Notes in Computer Science, pages 364–383. Springer Verlag, 1999.

    Google Scholar 

  5. J. Engelfriet. Branching processes of Petri nets. Acta Informatica, 28:575–591, 1991.

    Article  MathSciNet  Google Scholar 

  6. J. Esparza. Model checking using net unfoldings. In Proc. of TAPSOFT’93, volume 668 of Lecture Notes in Computer Science, pages 613–628. Springer Verlag, 1993.

    Google Scholar 

  7. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition system. In Proceedings of CONCUR’99, number 1664 in LNCS, pages 2–20. Springer, 1999.

    MATH  Google Scholar 

  8. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In Proc. of TACAS’96, volume 1055 of Lecture Notes in Computer Science, pages 87–106. Springer Verlag, 1996.

    Google Scholar 

  9. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.

    Google Scholar 

  10. P. Godefroid. Partial-order methods for the verification of concurrent systems. volume 1032 of Lecture Notes in Computer Science. Springer Verlag, 1996.

    Book  Google Scholar 

  11. P. Godefroid and G. J. Holzmann. On the verification of temporal properties. In Proc. 13th Int. Conf on Protocol Specification, Testing, and Verification, INWG/IFIP, pages 109–124, Liege, Belgium, May 1993.

    Google Scholar 

  12. G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, New Jersey, 1991.

    Google Scholar 

  13. G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. In The Spin Verification System, pages 23–32. American Mathematical Society, 1996. Proc. of the Second Spin Workshop.

    Google Scholar 

  14. A. Kondratyev, M. Kishinevsky, A. Taubin, and S. Ten. A structural approach for the analysis of Petri nets by reduced unfolding. In Proc. of ICATPN’96, volume 1091 of Lecture Notes in Computer Science, pages 346–365. Springer Verlag, 1996.

    MATH  Google Scholar 

  15. R. Langerak and E. Brinksma. A complete finite prefix for process algebra. In Proceedings of the 11th International Conference on Computer Aided Verification, Italy, number 1633 in LNCS, pages 184–195. Springer, 1999.

    Chapter  Google Scholar 

  16. K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. In Proc. of the 4th Conference on Computer Aided Verification, volume 663 of Lecture Notes in Computer Science, pages 164–175. Springer Verlag, 1992.

    Chapter  Google Scholar 

  17. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proc. of the 9th Conference on Computer Aided Verification, Lecture Notes in Computer Science, pages 352–363. Springer Verlag, 1997.

    Chapter  Google Scholar 

  18. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, events structures and domains, part I. Theoretical Computer Science, 13(1):85–108, 1981.

    Article  MathSciNet  Google Scholar 

  19. D. Peled. All from one, one for all: on model checking using representatives. In Proc. on the 5th Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 409–423. Springer Verlag, 1993.

    Chapter  Google Scholar 

  20. Doron Peled and Thomas Wilke. Stutter-invariant temporal properties are expressible without the nexttime operator. Information Processing Letters, 63:243–246, 1997.

    Article  MathSciNet  Google Scholar 

  21. D. Poitrenaud. Graphes de Processus Arborescents pour la Vérification de Propriétés. Thèse de doctorat, Université P. et M. Curie, Paris, France, 1996.

    Google Scholar 

  22. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logic. Journal of the Association for Computing Machinery, 32(3):733–749, July 1985.

    Article  MathSciNet  Google Scholar 

  23. A. Valmari. Stubborn sets for reduced state space generation. In Advances in Petri Nets, volume 483 of Lecture Notes in Computer Science, pages 491–515. Springer Verlag, 1991.

    Google Scholar 

  24. A. Valmari. On-the-fly verification with stubborn sets. In Proc. of the 5th Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 397–408. Springer Verlag, 1993.

    Chapter  Google Scholar 

  25. K. Varpaaniemi and M. Rauhamaa. The stubborn set method in practice. In Advances in Petri Nets, volume 616 of Lecture Notes in Computer Science, pages 389–393. Springer Verlag, 1992.

    Google Scholar 

  26. F. Wallner. Model checking LTL using net unfolding. In Proc. on the 10th Conference on Computer Aided Verification, Lecture Notes in Computer Science. Springer Verlag, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LaBRI, Université de Bordeaux I, Talence, France

    Jean-Michel Couvreur & Sébastien Grivet

  2. LIP6, Université Pierre et Marie Curie, Paris, France

    Denis Poitrenaud

Authors
  1. Jean-Michel Couvreur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sébastien Grivet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Denis Poitrenaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Aarhus, Ny Munkegade bldg 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. University of Brighton, Watts Building Lewes Road, Brighton, East Sussex, BN2 4GJ, UK

    Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Couvreur, JM., Grivet, S., Poitrenaud, D. (2000). Designing a LTL Model-Checker Based on Unfolding Graphs. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-44988-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67693-5

  • Online ISBN: 978-3-540-44988-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation