Skip to main content
Springer Nature Link
Log in

Bounded Reachability Checking with Process Semantics

  • Conference paper
  • First Online:
CONCUR 2001 — Concurrency Theory (CONCUR 2001)

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

Included in the following conference series:

  • 594 Accesses

Abstract

Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems. More specifically, we translate the bounded reachability problem for 1-safe Petri nets into constrained Boolean circuit satisfiability. We consider three semantics: process, step, and interleaving semantics. We show that process semantics has often the best performance for bounded reachability checking.

The financial support of the Academy of Finland (Projects 43963 and 47754), and Tekniikan Edistämissäätiö foundation 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science, 55(1):87–136, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Best and C. Fernández. Nonsequential Processes: A Petri Net View, volume 13 of EATCS monographs on Theoretical Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  3. 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, 1999. LNCS 1579.

    Chapter  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.

    Google Scholar 

  5. V. Diekert and Y. Métivier. Partial commutation and traces. In Handbook of formal languages, Vol. 3, pages 457–534. Springer, Berlin, 1997.

    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. LNCS 1491.

    Google Scholar 

  7. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm. In Proceedings of 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’96), pages 87–106, 1996. LNCS 1055.

    Google Scholar 

  8. J. Esparza, S. Römer, and W. Vogler. An improvement of McMillan’s unfolding algorithm, 2001. Accepted for publication in Formal Methods for System Design.

    Google Scholar 

  9. 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.

    Google Scholar 

  10. T. A. Junttila and I. Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In Computational Logic-CL 2000; First International Conference, pages 553–567, London, UK, 2000. LNCS 1861.

    Chapter  Google Scholar 

  11. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 1194–1201. AAAI Press / MIT Press, 1996.

    Google Scholar 

  12. H. C. M. Kleijn and M. Koutny. Process semantics of P/T-nets with inhibitor arcs. In Proceedings of the 21st International Conference on Application and Theory of Petri Nets, pages 261–281, 2000. LNCS 1825.

    Chapter  Google Scholar 

  13. S. Melzer and S. Römer. Deadlock checking using net unfoldings. In Proceedings of 9th International Conference on Computer-Aided Verification (CAV’ 97), pages 352–363, 1997. LNCS 1254.

    Google Scholar 

  14. S. Merkel. Verification of fault tolerant algorithms using PEP. Technical Report TUM-19734, SFB-Bericht Nr. 342/23/97 A, Technische Universität München, München, Germany, 1997.

    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.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Römer. Theorie und Praxis der Netzentfaltungen als Basis für die Verifikation nebenläufiger Systeme. PhD thesis, Technische Universität München, Fakultät für Informatik, München, Germany, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Keijo Heljanko

Authors
  1. Keijo Heljanko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, BRICS, Aalborg University, Fredrik Bajersvej 7, 9220, Aalborg, Denmark

    Kim G. Larsen

  2. BRICS, Aarhus University, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heljanko, K. (2001). Bounded Reachability Checking with Process Semantics. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_15

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics