Skip to main content
SpringerLink
Log in

Bounded LTL Model Checking with Stable Models

  • Conference paper
  • First Online:
Logic Programming and Nonmotonic Reasoning (LPNMR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2173))

Abstract

In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behavior of the net can be translated into a logic program such that the bounded model checking problem for the net can be solved by computing stable models of the corresponding program. The use of the stable model semantics leads to compact encodings of bounded reachability and deadlock detection tasks as well as the more general problem of bounded model checking of linear temporal logic. Some experimental results on solving deadlock detection problems using the translation and the Smodels system are presented.

This is an extended version of a paper titled “Answer Set Programming and Bounded Model Checking”[11] presented at the AAAI Spring 2001 Symposium on Answer Set Programming, Stanford, March 2001. The financial support of Academy of Finland (Projects 43963, 47754) and Tekniikan Edistämissäätiö are gratefully acknowledged.

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. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS’99), pages 193–207. Springer, March 1999. 201, 204, 207, 209, 211

    Google Scholar 

  2. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, 1992. 200

    Article  MATH  MathSciNet  Google Scholar 

  3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999. 200, 203

    Google Scholar 

  4. J. C. Corbett. Evaluating deadlock detection methods for concurrent software. Technical report, Department of Information and Computer Science, University of Hawaii at Manoa, 1995. 210

    Google Scholar 

  5. J. Desel and W. Reisig. Place/Transition Petri nets. In Lectures on Petri Nets I: Basic Models, pages 122–173. Springer-Verlag, 1998. 201

    Google Scholar 

  6. J. Esparza. Decidability and complexity of Petri net problems-An introduction. In Lectures on Petri Nets I: Basic Models, pages 374–428. Springer-Verlag, 1998. 204

    Google Scholar 

  7. F. Fages. Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51–60, 1994. 209

    Google Scholar 

  8. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070–1080, Seattle, USA, August 1988. The MIT Press. 204

    Google Scholar 

  9. K. Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37(3):247–268, 1999. 211

    MATH  MathSciNet  Google Scholar 

  10. K. Heljanko. Bounded reachability checking with process semantics. In Proceedings of the 12th International Conference on Concurrency Theory (Concur’2001), Aalborg, Denmark, August 2001. Accepted for publication. 211

    Google Scholar 

  11. K. Heljanko and I. Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press, Technical Report SS-01-01. 200, 210

    Google Scholar 

  12. G. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279–295, 1997. 200

    Article  MathSciNet  Google Scholar 

  13. O. Kupferman and M. Y. Vardi. Model checking of safety properties. In Proceeding of 11th International Conference on Computer Aided Verification (CAV’99), pages 172–183. Springer-Verlag, 1999. 207

    Google Scholar 

  14. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proceeding of 9th International Conference on Computer Aided Verification (CAV’97), pages 352–363, Haifa, Israel, Jun 1997. Springer-Verlag. 210, 211

    Google Scholar 

  15. I. Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999. 201

    Article  MATH  MathSciNet  Google Scholar 

  16. I. Niemelä and P. Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer Academic Publishers, 2000. 205, 206

    Google Scholar 

  17. K. Varpaaniemi, K. Heljanko, and J. Lilius. PROD 3.2-An advanced tool for efficient reachability analysis. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV’97), pages 472–475, Haifa, Israel, June 1997. Springer-Verlag. 200

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O. Box 5400, FIN-02015 HUT, Finland

    Keijo Heljanko & Ilkka Niemelä

Authors
  1. Keijo Heljanko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilkka Niemelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut fĂĽr Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Thomas Eiter

  2. Institut fĂĽr Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Wolfgang Faber

  3. Department of Computer Science Lexington, University of Kentucky, KY, 40506-0046, USA

    Miros law Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heljanko, K., Niemelä, I. (2001). Bounded LTL Model Checking with Stable Models. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45402-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42593-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation