Skip to main content
SpringerLink
Log in

Model checking LTL using constraint programming

  • Invited Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1997 (ICATPN 1997)

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

Included in the following conference series:

Abstract

The model-checking problem for 1-safe Petri nets and linear-time temporal logic (LTL) consists of deciding, given a 1-safe Petri net and a formula of LTL, whether the Petri net satisfies the property encoded by the formula. This paper introduces a semidecision test for this problem. By a semidecision test we understand a procedure which may answer ‘yes’, in which case the Petri net satisfies the property, or ‘don't know’. The test is based on a variant of the so called automata-theoretic approach to model-checking and on the notion of T-invariant. We analyse the computational complexity of the test, implement it using 21p-a constraint programming tool, and apply it to two case studies.

This paper is a (very) abbreviated version of [6].

This work is supported by the Sonderforschungsbereich SFB-342 A3.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Eike Best, Raymond Devillers, and Jon G. Hall. The Box Calculus: a New Causal Algebra with Multi-Label Communication. Number 4/92 in Hildesheimer Informatik-Bericht. Universität Hildesheim, Mai 1992.

    Google Scholar 

  2. Eike Best and Richard Pinder Hopkins. B(PN)2 — a Basic Petri Net Programming Notation. In A. Bode, M. Reeve, and G. Wolf, editors, Proceedings of PARLE '93, volume 694 of Lecture Notes in Computer Science, pages 379–390, 1993.

    Google Scholar 

  3. Luc Bouge. Repeated Synchronous Snapshots and their Implementation in CSP. In W. Brauer, editor, Proceedings 12th ICALP, volume 194 of Lecture Notes in Computer Science, pages 63–70. Springer, 1981.

    Google Scholar 

  4. Ernest Chang and Rosemary Roberts. An Improved Algorithm for Decentralised Extrema-finding in Circular Distributed Systems. Communication of the ACM, 22(5):281–283, 1979.

    Google Scholar 

  5. Jörg Desel and Javier Esparza. Free Choice Petri Nets. Cambridge University Press, 1995.

    Google Scholar 

  6. J. Esparza and S. Melzer. Model-Checking LTL using Constraint Programming. Technical report, Technische Universität München, March 1997. Available at http://papa.informatik.tu-muenchen.de/forschung/sfb342_a3/refs.html.

    Google Scholar 

  7. Javier Esparza and Glenn Bruns. Trapping Mutual Exclusion in the Box Calculus. Theoretical Computer Science, 153:95–128, 1996.

    Google Scholar 

  8. Rob Gerth, Doron Peled, Moshe Vardi, and Pierre Wolper. Simple On-the-fly Automatic Verification of Linear Temporal Logic. In Protocol Specification Testing and Verification, pages 3–18, Warsaw, Poland, 1995. Chapman & Hall.

    Google Scholar 

  9. Patrice Godefroid. Partial-Order Methods for Verification of Concurrent Systems, volume 1032 of Lecture Notes in Computer Science. Springer, 1996.

    Google Scholar 

  10. Bernd Grahlman and Eike Best. PEP-More than a Petri Net Tool. In T. Margaria and B. Steffen, editors, TACAS '96, volume 1055 of Lecture Notes in Computer Science, pages 397–401. Springer-Verlag, 1996.

    Google Scholar 

  11. Gerald J. Holzmann. Basic Spin Manual. AT&T Bell Lab., Murray Hill.

    Google Scholar 

  12. Joxan Jaffar and Jean-Lois Lassez. Constraint logic programming. In 14th Annual ACM Symposium on Principles of Programming Languages, 1987.

    Google Scholar 

  13. Ken McAloon and Carol Tretkoff. Optimization and Computational Logic. John Wiley & Sons, 1996.

    Google Scholar 

  14. Antti Valmari. A Stubborn Attack on State Explosion. Formal Methods in System Design, 1:297–322, 1992.

    Google Scholar 

  15. M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1–37, 1994.

    Article  Google Scholar 

  16. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logics in Computer Science, pages 322–331, Cambridge, June 1986.

    Google Scholar 

  17. F. Wallner. Model-Checking LTL using Net Unfoldings. Technical report, Technische Universität München, Institut für Informatik, Forthcoming 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstraße 21, D-80333, München, Germany

    Javier Esparza & Stephan Melzer

Authors
  1. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan Melzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierre Azéma Gianfranco Balbo

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esparza, J., Melzer, S. (1997). Model checking LTL using constraint programming. In: Azéma, P., Balbo, G. (eds) Application and Theory of Petri Nets 1997. ICATPN 1997. Lecture Notes in Computer Science, vol 1248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63139-9_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-63139-9_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63139-2

  • Online ISBN: 978-3-540-69187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation