Skip to main content
SpringerLink
Log in

Compositional Reachability in Petri Nets

  • Conference paper
Reachability Problems (RP 2014)

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

Included in the following conference series:

Abstract

We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries: we consider the algebraic decomposition of the net of interest as part of the input. We formally prove the correctness of the technique and contrast the performance of our implementation with state-of-the-art tools that exploit partial order reduction techniques on the global net.

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. Bonchi, F., Pous, D.: Checking NFA Equivalence with Bisimulations up to Congruence. In: PoPL (2013)

    Google Scholar 

  2. Bruni, R., Melgratti, H., Montanari, U., Sobociński, P.: Connector algebras for C/E and P/T nets’ Interactions. Logical Methods in Computer Science 9(3) (2013)

    Google Scholar 

  3. Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P/T nets interactions. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 312–326. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 326–337. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  5. Clarke, E.M., Long, D., McMillan, K.: Compositional model checking. In: LiCS 1989, pp. 352–362 (1989)

    Google Scholar 

  6. Corbett, J.C.: Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering 22(3), 161–180 (1996)

    Article  Google Scholar 

  7. Esparza, J., Heljanko, K.: Implementing LTL model checking with net unfoldings. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 37–56. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Esparza, J., Heljanko, K.: Unfoldings: a partial-order approach to model checking. Springer (2008)

    Google Scholar 

  9. Esparza, J., Römer, S., Vogler, W.: An improvement of McMillan’s unfolding algorithm. Form Method Syst Des 30(3), 285–310 (2002)

    Article  Google Scholar 

  10. Heljanko, K., Khomenko, V., Koutny, M.: Parallelisation of the Petri Net Unfolding Algorithm. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 371–385. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): A categorical algebra of transition systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 307–321. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  12. Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged Processes — A New Condensed Representation of Petri Net Behaviour. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 338–352. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Khomenko, V., Koutny, M., Vogler, W.: Canonical prefixes of Petri net unfoldings. Acta Inform. 40(2), 95–118 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Koutny, M., Khomenko, V.: Linear Programming Deadlock Checking Using Partial Order Dependencies. Technical report, Newcastle University (2000)

    Google Scholar 

  15. Mayr, R., Clemente, L.: Advanced Automata Minimization. In: POPL (2013)

    Google Scholar 

  16. McMillan, K.: A technique of a state space search based on unfolding. Form. Method Syst. Des. 6(1), 45–65 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  17. Milner, R.: A Calculus of Communicating Systems. Prentice Hall (1989)

    Google Scholar 

  18. Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part I. Theoretical Computer Science 13(1), 85–108 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rodríguez, C., Schwoon, S.: Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 492–495. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  20. Schmidt, K.: LoLA A Low Level Analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465–474. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  21. Sobociński, P.: Representations of petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 554–568. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  22. Sobociński, P., Stephens, O.: Penrose: Putting Compositionality to Work for Petri Net Reachability. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 346–352. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  23. Sobociński, P., Stephens, O.: Reachability via compositionality in Petri nets. arXiv:1303.1399v1 (2013)

    Google Scholar 

  24. Sobociński, P., Stephens, O.: A Programming Language for Spatial Distribution of Net Systems. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 150–169. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  25. Starke, P.: Reachability analysis of Petri nets using symmetries. Systems Analysis Modelling Simulation 5, 292–303 (1991)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECS, University of Southampton, UK

    Julian Rathke, Paweł Sobociński & Owen Stephens

Authors
  1. Julian Rathke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Sobociński
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Owen Stephens
    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 Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Joël Ouaknine

  2. Department of Computer Science, University of Liverpool, Liverpool, UK

    Igor Potapov

  3. Department of Computer Science, University of Oxford, UK

    James Worrell

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Rathke, J., Sobociński, P., Stephens, O. (2014). Compositional Reachability in Petri Nets. In: Ouaknine, J., Potapov, I., Worrell, J. (eds) Reachability Problems. RP 2014. Lecture Notes in Computer Science, vol 8762. Springer, Cham. https://doi.org/10.1007/978-3-319-11439-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11439-2_18

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11438-5

  • Online ISBN: 978-3-319-11439-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation