Skip to main content
SpringerLink
Log in

A Polynomial-Time Algorithm for Detecting Potentially Unbounded Places in a Petri Net-Based Concurrent System

  • Conference paper
  • First Online:
Euro-Par 2023: Parallel Processing Workshops (Euro-Par 2023)

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

Included in the following conference series:

  • 78 Accesses

Abstract

This paper deals with the preliminary verification of the Petri net-based concurrent system. In particular, a novel algorithm aimed at the identification of the potentially unbounded places in a system is proposed. The idea is based on the structural analysis of the system, and it involves the linear algebra technique. Contrary to the most popular techniques, which are exponential in the general case, the proposed algorithm is bounded by a polynomial with the number of places and transitions of a Petri net. The efficiency and effectiveness of the presented solution were examined through the experimental setup performed on 247 test cases (benchmarks). The obtained results were compared with the most popular Petri net-oriented tools, such as GreatSPN and PIPE.

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 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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

References

  1. Girault, C., Valk, R.: Petri Nets for Systems Engineering: A Guide to Modeling, Verification, and Applications. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-662-05324-9

    Book  Google Scholar 

  2. Patalas-Maliszewska, J., Posdzich, M., Skrzypek, K.: Modelling information for the burnishing process in a cyber-physical production system. Int. J. Appl. Math. Comput. Sci. (AMCS) 32, 345–354 (2022). https://doi.org/10.34768/amcs-2022-0025

    Article  Google Scholar 

  3. Wojnakowski, M., Wiśniewski, R., Bazydło, G., Popławski, M.: Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems. Appl. Math. Comput. Sci. (AMCS) 31, 647–657 (2021). https://doi.org/10.34768/amcs-2021-0045

    Article  Google Scholar 

  4. Lee, E.A., Seshia, S.A.: Introduction to Embedded Systems: A Cyber-Physical Systems Approach. The MIT Press, Cambridge (2016)

    Google Scholar 

  5. Wiśniewski, R., Wojnakowski, M., Li, Z.: Design and verification of Petri-net-based cyber-physical systems oriented toward implementation in field-programmable gate arrays—a case study example. Energies 16, 67 (2023). https://doi.org/10.3390/en16010067

    Article  Google Scholar 

  6. Diaz, M.: Applying Petri net based models in the design of systems. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds.) Concurrency and Nets, pp. 23–67. Springer, Heidelberg (1987). https://doi.org/10.1007/978-3-642-72822-8_7

    Chapter  Google Scholar 

  7. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77, 541–580 (1989). https://doi.org/10.1109/5.24143

    Article  Google Scholar 

  8. Wojnakowski, M., Wiśniewski, R.: Verification of the boundedness property in a Petri net-based specification of the control part of cyber-physical systems. In: Camarinha-Matos, L.M., Ferreira, P., Brito, G. (eds.) DoCEIS 2021. IAICT, vol. 626, pp. 83–91. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-78288-7_8

    Chapter  Google Scholar 

  9. Reisig, W.: Nets consisting of places and transistions. In: Reisig, W. (ed.) Petri Nets. EATCS Monographs on Theoretical Computer Science, vol. 4, pp. 62–76. Springer, Heidelberg (1985). https://doi.org/10.1007/978-3-642-69968-9_6

    Chapter  Google Scholar 

  10. Martínez, J., Silva, M.: A simple and fast algorithm to obtain all invariants of a generalised Petri net. In: Girault, C., Reisig, W. (eds.) Application and Theory of Petri Nets. Informatik-Fachberichte, vol. 52, pp. 301–310. Springer, Heidelberg (1982). https://doi.org/10.1007/978-3-642-68353-4_47

    Chapter  Google Scholar 

  11. Patalas-Maliszewska, J., Wiśniewski, R., Topczak, M., Wojnakowski, M.: Modelling of the effectiveness of integrating additive manufacturing technologies into Petri net-based manufacturing systems. In: 2022 IEEE International Conference on Fuzzy Systems, pp. 1–9 (2022)

    Google Scholar 

  12. Wiśniewski, R., Patalas-Maliszewska, J., Wojnakowski, M., Topczak, M.: Interpreted Petri nets in modelling and analysis of physical resilient manufacturing systems. In: 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1096–1102 (2022)

    Google Scholar 

  13. Yuster, A.T., Yuster, T.: The reduced row echelon form of a matrix is unique: a simple proof. Math. Mag. (1984)

    Google Scholar 

  14. Amparore, E.G., Balbo, G., Beccuti, M., Donatelli, S., Franceschinis, G.: 30 years of GreatSPN. In: Fiondella, L., Puliafito, A. (eds.) Principles of Performance and Reliability Modeling and Evaluation. SSRE, pp. 227–254. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30599-8_9

    Chapter  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Science Centre, Poland, under Grant number 2019/35/B/ST6/01683.

Author information

Authors and Affiliations

  1. Institute of Control and Computation Engineering, University of Zielona Góra, 65-516, Zielona Góra, Poland

    Marcin Wojnakowski, Remigiusz Wiśniewski & Mateusz Popławski

Authors
  1. Marcin Wojnakowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Remigiusz Wiśniewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mateusz Popławski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Wojnakowski .

Editor information

Editors and Affiliations

  1. University of Cyprus, Nicosia, Cyprus

    Demetris Zeinalipour

  2. University of Santiago de Compostela, Santiago de Compostela, Spain

    Dora Blanco Heras

  3. University of Cyprus, Nicosia, Cyprus

    George Pallis

  4. Cyprus University of Technology, Limassol, Cyprus

    Herodotos Herodotou

  5. University of Nicosia, Nicosia, Cyprus

    Demetris Trihinas

  6. Inria, Nantes, France

    Daniel Balouek

  7. Louisiana State University, Baton Rouge, LA, USA

    Patrick Diehl

  8. Karlsruhe Institute of Technology, Karlsruhe, Germany

    Terry Cojean

  9. Ludwig-Maximilians-Universität, Munich, Germany

    Karl Fürlinger

  10. Roskilde University, Roskilde, Denmark

    Maja Hanne Kirkeby

  11. Bank of Italy, Rome, Italy

    Matteo Nardelli

  12. Roma Tre University, Rome, Italy

    Pierangelo Di Sanzo

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wojnakowski, M., Wiśniewski, R., Popławski, M. (2024). A Polynomial-Time Algorithm for Detecting Potentially Unbounded Places in a Petri Net-Based Concurrent System. In: Zeinalipour, D., et al. Euro-Par 2023: Parallel Processing Workshops. Euro-Par 2023. Lecture Notes in Computer Science, vol 14352. Springer, Cham. https://doi.org/10.1007/978-3-031-48803-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-48803-0_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-48802-3

  • Online ISBN: 978-3-031-48803-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation