Skip to main content
SpringerLink
Log in

Counting Petri net markings from reduction equations

  • Spin 2018
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

We propose a method to count the number of reachable markings of a Petri net without having to enumerate these first. The method relies on a structural reduction system that reduces the number of places and transitions of the net in such a way that we can faithfully compute the number of reachable markings of the original net from the reduced net and the reduction history. The method has been implemented, and computing experiments show that reductions are effective on a large benchmark of models.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

References

  1. Behle, M., Eisenbrand, F.: 0/1 vertex and facet enumeration with BDDs. In: 9th Workshop on Algorithm Engineering and Experiments. SIAM (2007)

  2. Berthelot, G.: Checking properties of nets using transformations. In: European Workshop on Applications and Theory in Petri Nets, pp. 19–40. Springer (1985)

  3. Berthelot, G.: Transformations and decompositions of nets. In: Advanced Course on Petri Nets, pp. 359–376. Springer (1986)

  4. Berthomieu, B., Le Botlan, D., Dal Zilio, S.: Petri net reductions for counting markings. In: International Symposium on Model Checking Software, volume 10869 of LNCS, pp. 65–84. Springer (June 2018)

  5. Berthomieu, B., Ribet, P.-O., Vernadat, F.: The tool TINA-construction of abstract state spaces for Petri nets and Time Petri nets. Int. J. Prod. Res. 42(14), 2741–2756 (2004)

    Article  Google Scholar 

  6. Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)

    Article  MathSciNet  Google Scholar 

  7. De Loera, J.A., Hemmecke, R., Köppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. SIAM, Philadelphia (2013)

    MATH  Google Scholar 

  8. De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symb. Comput. 38(4), 1273–1302 (2004)

    Article  MathSciNet  Google Scholar 

  9. Esparza, J., Schröter, C.: Net reductions for LTL model-checking. In: Advanced Research Working Conference on Correct Hardware Design and Verification Methods, pp. 310–324. Springer (2001)

  10. Kordon, F., et al.: Complete Results for the 2018 Edition of the Model Checking Contest. http://mcc.lip6.fr/2018/results.php (June 2018)

  11. Kordon, F., et al. MCC’2017—the seventh model checking contest. In: Transactions on Petri Nets and Other Models of Concurrency XIII, pp. 181–209. Springer (2018)

  12. Hack, M.: Decidability questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology (1976)

  13. Hillah, L.M., Kordon, F.: Petri Nets Repository: a tool to benchmark and debug Petri Net tools. In: 38th International Conference on Petri Nets and Other Models of Concurrency (Petri Nets), LNCS, vol. 10258. Springer (June 2017)

  14. Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P/T nets. In: Transactions on Petri Nets and Other Models of Concurrency XI, pp. 307–318. Springer (2016)

  15. Levy, F.K., Thompson, G.L., Wiest, J.D.: Introduction to the critical-path method. Industrial Scheduling. Prentice-Hall, Englewood Cliffs (1963)

    Google Scholar 

  16. Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Upper Saddle River (1981)

    MATH  Google Scholar 

  17. Recalde, L., Teruel, E., Silva, M.: Improving the decision power of rank theorems. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation, vol. 4, pp. 3768–3773 (1997)

  18. Schmidt, K.: Using Petri net invariants in state space construction. In: Tools and Algorithms for the Construction and Analysis of Systems, pp. 473–488 (2003)

  19. Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place/transition net systems. In: Advanced Course on Petri Nets, pp. 309–373. Springer (1996)

  20. Stahl, C.: Decomposing Petri net state spaces. In: 18th German Workshop on Algorithms and Tools for Petri Nets (AWPN 2011), Hagen, Germany (Sep 2011)

  21. Thierry-Mieg, Y., Poitrenaud, D., Hamez, A., Kordon, F.: Hierarchical set decision diagrams and regular models. In: TACAS—Tools and Algorithms for the Construction and Analysis of Systems, pp. 1–15 (2009)

  22. Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., Bruynooghe, M.: Counting integer points in parametric polytopes using barvinok’s rational functions. Algorithmica 48(1), 37–66 (2007)

    Article  MathSciNet  Google Scholar 

  23. Wolf, K.: Generating Petri net state spaces. In: Petri Nets and Other Models of Concurrency-ICATPN 2007, pp. 29–42 (2007)

Download references

Author information

Authors and Affiliations

  1. LAAS-CNRS, Université de Toulouse, CNRS, Toulouse, France

    Bernard Berthomieu & Silvano Dal Zilio

  2. LAAS-CNRS, Université de Toulouse, INSA, Toulouse, France

    Didier Le Botlan

Authors
  1. Bernard Berthomieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Didier Le Botlan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Silvano Dal Zilio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Didier Le Botlan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Berthomieu, B., Le Botlan, D. & Dal Zilio, S. Counting Petri net markings from reduction equations. Int J Softw Tools Technol Transfer 22, 163–181 (2020). https://doi.org/10.1007/s10009-019-00519-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-019-00519-1

Keywords

Search

Navigation