Skip to main content
SpringerLink
Log in

Resource Equivalences in Petri Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets and Concurrency (PETRI NETS 2017)

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

Abstract

Tokens in Petri net models may represent a control flow state, or resources produced/consumed by transition firings. From the resource perspective a part of a Petri net marking can be considered as a store needed for ensuring some future system behavior. The talk is devoted to the study of several types of resource equivalence in Petri nets. A resource is defined as a part (submultiset) of a Petri net marking and two resources are called equivalent iff replacing one of them by another in any reachable marking does not change the observable Petri net behavior. We investigate decidability of resource equivalences, present an algorithm for computing its finite approximation, and discuss applicability of resource equivalences to state space reduction and adaptive system processing.

This work is supported by the Basic Research Program at the National Research University Higher School of Economics and Russian Foundation for Basic Research, project No. 16-01-00546.

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

References

  1. Autant, C., Schnoebelen, P.: Place bisimulations in Petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 45–61. Springer, Heidelberg (1992). doi:10.1007/3-540-55676-1_3

    Chapter  Google Scholar 

  2. Baldan, P., Bonchi, F., Gadducci, F.: Encoding asynchronous interactions using open Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 99–114. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04081-8_8

    Chapter  Google Scholar 

  3. Bashkin, V.A., Lomazova, I.A.: Petri nets and resource bisimulation. Fundam. Inf. 55, 101–114 (2003). http://content.iospress.com/articles/fundamenta-informaticae/fi55-2-02

    MathSciNet  MATH  Google Scholar 

  4. Bashkin, V.A., Lomazova, I.A.: Resource similarities in Petri net models of distributed systems. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 35–48. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45145-7_4

    Chapter  Google Scholar 

  5. Bashkin, V.A., Lomazova, I.A.: Similarity of generalized resources in Petri nets. In: Malyshkin, V. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 27–41. Springer, Heidelberg (2005). doi:10.1007/11535294_3

    Chapter  Google Scholar 

  6. Bashkin, V.A., Lomazova, I.A.: Decidability of \(k\)-soundness for workflow nets with an unbounded resource. In: Koutny, M., Haddad, S., Yakovlev, A. (eds.) Transactions on Petri Nets and Other Models of Concurrency IX. LNCS, vol. 8910, pp. 1–18. Springer, Heidelberg (2014). doi:10.1007/978-3-662-45730-6_1

    Google Scholar 

  7. Dong, X., Fu, Y., Varacca, D.: Place bisimulation and liveness for open Petri nets. In: Fränzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 1–17. Springer, Cham (2016). doi:10.1007/978-3-319-47677-3_1

    Chapter  Google Scholar 

  8. Farwer, B.: A linear logic view of object Petri nets. Fundam. Inf. 37(3), 225–246 (1999). http://dl.acm.org/citation.cfm?id=2377296.2377299

    MathSciNet  MATH  Google Scholar 

  9. Farwer, B., Lomazova, I.: A systematic approach towards object-based Petri net formalisms. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 255–267. Springer, Heidelberg (2001). doi:10.1007/3-540-45575-2_26

    Chapter  Google Scholar 

  10. Finkel, A.: The ideal theory for WSTS. In: Larsen, K.G., Potapov, I., Srba, J. (eds.) RP 2016. LNCS, vol. 9899, pp. 1–22. Springer, Cham (2016). doi:10.1007/978-3-319-45994-3_1

    Chapter  Google Scholar 

  11. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256(1), 63–92 (2001). http://www.sciencedirect.com/science/article/pii/S030439750000102X

    Article  MathSciNet  MATH  Google Scholar 

  12. Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1–101 (1987). http://www.sciencedirect.com/science/article/pii/0304397587900454

    Article  MathSciNet  MATH  Google Scholar 

  13. Heckel, R.: Open Petri nets as semantic model for workflow integration. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 281–294. Springer, Heidelberg (2003). doi:10.1007/978-3-540-40022-6_14

    Chapter  Google Scholar 

  14. Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3–2(1), 326–336 (1952). http://dx.doi.org/10.1112/plms/s3-2.1.326

    Article  MathSciNet  MATH  Google Scholar 

  15. Hirshfeld, Y.: Congruences in commutative semigroups. Technical report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh (1994)

    Google Scholar 

  16. Jančar, P.: Decidability questions for bisimilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 581–592. Springer, Heidelberg (1994). doi:10.1007/3-540-57785-8_173

    Chapter  Google Scholar 

  17. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147–195 (1969). http://www.sciencedirect.com/science/article/pii/S0022000069800115

    Article  MathSciNet  MATH  Google Scholar 

  18. Lasota, S.: Decidability border for Petri nets with data: WQO dichotomy conjecture. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 20–36. Springer, Cham (2016). doi:10.1007/978-3-319-39086-4_3

    Chapter  Google Scholar 

  19. Lomazova, I.A.: Nested Petri nets - a formalism for specification and verification of multi-agent distributed systems. Fundam. Inf. 43(1), 195–214 (2000). http://www.scopus.com/inward/record.url?eid=2-s2.0-0034250902&partnerID=40&md5=8a9efd42010e494aaaa3a09b99e97f25

    MathSciNet  MATH  Google Scholar 

  20. Lomazova, I.A.: Nested Petri nets: multi-level and recursive systems. Fundam. Inf. 47(3–4), 283–293 (2001). http://dl.acm.org/citation.cfm?id=1220035.1220044

    MathSciNet  MATH  Google Scholar 

  21. Lomazova, I.A., Romanov, I.V.: Analyzing compatibility of services via resource conformance. Fundam. Inf. 128(1–2), 129–141 (2013). http://dx.doi.org/10.3233/FI-2013-937

    MathSciNet  MATH  Google Scholar 

  22. Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested Petri Nets. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol. 1755, pp. 208–220. Springer, Heidelberg (2000). doi:10.1007/3-540-46562-6_18

    Chapter  Google Scholar 

  23. Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)

    MATH  Google Scholar 

  24. Rédei, L.: The Theory of Finitely Generated Commutative Semigroups. Oxford University Press, New York (1965)

    MATH  Google Scholar 

  25. Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of Petri nets with unordered data. Theoret. Comput. Sci. 412(34), 4439–4451 (2011). http://www.sciencedirect.com/science/article/pii/S0304397511003896

    Article  MathSciNet  MATH  Google Scholar 

  26. Schnoebelen, P., Sidorova, N.: Bisimulation and the reduction of Petri Nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 409–423. Springer, Heidelberg (2000). doi:10.1007/3-540-44988-4_23

    Chapter  Google Scholar 

  27. Sidorova, N., Stahl, C.: Soundness for resource-constrained workflow nets is decidable. IEEE Trans. Syst. Man Cybern.: Syst. 43(3), 724–729 (2013)

    Article  Google Scholar 

Download references

Acknowledgment

I would like to thank Vladimir Bashkin for the many years of collaborative research, of which this paper presents just a part.

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, 20 Myasnitskaya ul., Moscow, 101000, Russia

    Irina A. Lomazova

Authors
  1. Irina A. Lomazova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Irina A. Lomazova .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science (MF 7.103), Eindhoven University of Technology, Eindhoven, Noord-Brabant, The Netherlands

    Wil van der Aalst

  2. Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Lomazova, I.A. (2017). Resource Equivalences in Petri Nets. In: van der Aalst, W., Best, E. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2017. Lecture Notes in Computer Science(), vol 10258. Springer, Cham. https://doi.org/10.1007/978-3-319-57861-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57861-3_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation