Skip to main content
SpringerLink
Log in

Occam’s Razor Applied to the Petri Net Coverability Problem

  • Conference paper
  • First Online:
Reachability Problems (RP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9899))

Included in the following conference series:

Abstract

The verification of safety properties for concurrent systems often reduces to the coverability problem for Petri nets. This problem was shown to be ExpSpace-complete forty years ago. Driven by the concurrency revolution, it has regained a lot of interest over the last decade. In this paper, we propose a generic and simple approach to solve this problem. Our method is inspired from the recent approach of Blondin, Finkel, Haase and Haddad [3]. Basically, we combine forward invariant generation techniques for Petri nets with backward reachability for well-structured transition systems. An experimental evaluation demonstrates the efficiency of our approach.

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 EPUB and 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

Notes

  1. 1.

    The statement of Theorem 7 in [18] is wrong since it is based on a too strong definition of limit-reachability. However, the proof becomes correct with our definitions and notations.

References

  1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1–2), 109–127 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Blondin, M., Finkel, A., Haase, C., Haddad, S.: QCover with benchmarks. http://www-etud.iro.umontreal.ca/~blondimi/doc/qcover_with_benchmarks.zip

  3. Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 480–496. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49674-9_28

    Chapter  Google Scholar 

  4. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238–252. ACM (1977)

    Google Scholar 

  5. Donaldson, A., Kaiser, A., Kroening, D., Wahl, T.: Symmetry-aware predicate abstraction for shared-variable concurrent programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 356–371. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. D’Osualdo, E., Kochems, J., Ong, C.-H.L.: Automatic verification of Erlang-style concurrency. In: Logozzo, F., Fähndrich, M. (eds.) Static Analysis. LNCS, vol. 7935, pp. 454–476. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An SMT-based approach to coverability analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 603–619. Springer, Heidelberg (2014)

    Google Scholar 

  8. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Inf. Comput. 256(1–2), 63–92 (2001)

    MathSciNet  MATH  Google Scholar 

  9. Fraca, E., Haddad, S.: Complexity analysis of continuous Petri nets. Inf. Comput. 137(1), 1–28 (2015)

    MathSciNet  MATH  Google Scholar 

  10. Ganty, P.: Mist - a safety checker for petri nets and extensions. http://github.com/pierreganty/mist

  11. Geffroy, T., Leroux, J., Sutre, G.: ICover patch. http://dept-info.labri.u-bordeaux.fr/~tgeffroy/icover/

  12. German, S.M., Sistla, A.P.: Reasoning about systems with many processes. Inf. Comput. 39(3), 675–735 (1992)

    MathSciNet  MATH  Google Scholar 

  13. Kaiser, A., Kroening, D., Wahl, T.: A widening approach to multithreaded program verification. ACM Trans. Program. Lang. Syst. 36(4), 14:1–14:29 (2014)

    Article  MathSciNet  Google Scholar 

  14. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lipton, R.J.: The reachability problem requires exponential space. Technical report 62, Yale University (1976)

    Google Scholar 

  16. de Moura, L., Bjørner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6(2), 223–231 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. Recalde, L., Teruel, E., Silva, M.: Autonomous continuous P/T systems. In: Donatelli, S., Kleijn, J. (eds.) ICATPN 1999. LNCS, pp. 107–126. Springer, Heidelberg (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bordeaux, LaBRI, UMR 5800, Talence, France

    Thomas Geffroy

  2. University of Bordeaux and CNRS, LaBRI, UMR 5800, Talence, France

    Jérôme Leroux & Grégoire Sutre

Authors
  1. Thomas Geffroy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jérôme Leroux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Grégoire Sutre
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Geffroy .

Editor information

Editors and Affiliations

  1. Aalborg University, Aalborg, Denmark

    Kim Guldstrand Larsen

  2. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

  3. Aalborg University, Aalborg, Denmark

    Jiří Srba

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Geffroy, T., Leroux, J., Sutre, G. (2016). Occam’s Razor Applied to the Petri Net Coverability Problem. In: Larsen, K., Potapov, I., Srba, J. (eds) Reachability Problems. RP 2016. Lecture Notes in Computer Science(), vol 9899. Springer, Cham. https://doi.org/10.1007/978-3-319-45994-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45994-3_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45993-6

  • Online ISBN: 978-3-319-45994-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation