Skip to main content

Property-Preserving Transformations of Elementary Net Systems Based on Morphisms

  • Chapter
  • First Online:
Transactions on Petri Nets and Other Models of Concurrency XVI

Part of the book series: Lecture Notes in Computer Science ((TOPNOC,volume 13220))

Abstract

Structural transformations that preserve properties of formal models of concurrent systems make their verification easier. We define structural transformations that allow to abstract and refine elementary net systems. Relations between abstract models and their refinements are formalized using morphisms. Transformations proposed in this paper induce morphisms between elementary net systems as well as preserve their behavioral properties, especially deadlocks. We also show the application of the proposed transformations to the construction of a correct composition of interacting workflow net components.

This work is supported by MIUR and the Basic Research Program at HSE University.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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. van der Aalst, W.M.P.: Workflow verification: finding control-flow errors using petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161–183. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45594-9_11

  2. Bernardinello, L., Mangioni, E., Pomello, L.: Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms. In: Koutny, M., van der Aalst, W.M.P., Yakovlev, A. (eds.) Transactions on Petri Nets and Other Models of Concurrency VIII. LNCS, vol. 8100, pp. 48–70. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40465-8_3

  3. Bernardinello, L., De Cindio, F.: A survey of basic net models and modular net classes. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992. LNCS, vol. 609, pp. 304–351. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55610-9_177

    Chapter  Google Scholar 

  4. Bernardinello, L., Lomazova, I., Nesterov, R., Pomello, L.: Soundness-preserving composition of synchronously and asynchronously interacting workflow net components (2020). https://arxiv.org/pdf/2001.08064.pdf

  5. Berthelot, G.: Checking properties of nets using transformations. In: Rozenberg, G. (ed.) Advances in Petri Nets 1985. LNCS, vol. 222, pp. 19–40. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-18086-9

  6. Berthelot, G., Roucairol, G.: Reduction of Petri-nets. In: Mazurkiewicz, A. (ed.) Mathematical Foundations of Computer Science 1976. LNCS, vol. 45, pp. 202–209. Springer, Heidelberg (1976). https://doi.org/10.1007/978-1-4612-3086-1

  7. Desel, J., Merceron, A.: Vicinity Respecting Homomorphisms for Abstracting System Requirements. In: Jensen, K., Donatelli, S., Koutny, M. (eds.) Transactions on Petri Nets and Other Models of Concurrency IV. LNCS, vol. 6550, pp. 1–20. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-18222-8_1

  8. Ehrig, H., Hoffmann, K., Padberg, J.: Transformations of Petri nets. Electr. Notes Theor. Comput. Sci. 148(1), 151–172 (2006)

    Article  Google Scholar 

  9. Esparza, J., Silva, M.: Top-down synthesis of live and bounded free choice nets. In: Rozenberg, G. (ed.) ICATPN 1990. LNCS, vol. 524, pp. 118–139. Springer, Heidelberg (1991). https://doi.org/10.1007/BFb0019972

  10. Genrich, H., Thiagarajan, P.: A theory of bipolar synchronisation schemes. Theor. Comput. Sci. 30(3), 241–318 (1984)

    Article  Google Scholar 

  11. Hack, M.: Analysis of Production Schemata by Petri Nets. TR-94. MIT Press, Boston (1972)

    Google Scholar 

  12. Lomazova, I.A.: Resource Equivalences in Petri Nets. In: van der Aalst, W., Best, E. (eds.) PETRI NETS 2017. LNCS, vol. 10258, pp. 19–34. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57861-3_3

  13. Mikolajczak, B., Wang, Z.: Conceptual modeling of concurrent systems through stepwise abstraction and refinement using Petri net morphisms. In: Song, I., Liddle, S., Ling, T., Scheuermann, P. (eds.) Conceptual Modeling - ER 2003. LNCS, vol. 2813, pp. 433–445 (2003). https://doi.org/10.1007/b13244

  14. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  15. Murata, T., Suzuki, I.: A method for stepwise refinement and abstraction of petri nets. J. Comput. Syst. Sci. 27(1), 51–76 (1983)

    Article  MathSciNet  Google Scholar 

  16. Nesterov, R., Lomazova, I.: Asynchronous interaction patterns for mining multi-agent system models from event logs. In: Lomazova, I., Kalenkova, A., Yavorsky, R. (eds.) Proceedings of the MACSPro Workshop 2019. CEUR Workshop Proceedings, vol. 2478, pp. 62–73. CEUR-WS.org (2019)

    Google Scholar 

  17. Nielsen, M., Winskel, G.: Petri nets and bisimulations. Theor. Comput. Sci. 153, 211–244 (1996)

    Article  MathSciNet  Google Scholar 

  18. Padberg, J., Urbášek, M.: Rule-Based Refinement of Petri Nets: A Survey. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 161–196. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40022-6_9

  19. Rozenberg, G., Engelfriet, J.: Elementary net systems. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998). https://doi.org/10.1007/3-540-65306-6_14

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

  21. Valette, R.: Analysis of Petri nets by stepwise refinements. J. Comput. Syst. Sci. 18(1), 35–46 (1979)

    Article  MathSciNet  Google Scholar 

  22. Winskel, G.: Petri nets, algebras, morphisms, and compositionality. Inf. Comput. 72(3), 197–238 (1987)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roman Nesterov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer-Verlag GmbH Germany, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bernardinello, L., Lomazova, I., Nesterov, R., Pomello, L. (2022). Property-Preserving Transformations of Elementary Net Systems Based on Morphisms. In: Koutny, M., Kordon, F., Moldt, D. (eds) Transactions on Petri Nets and Other Models of Concurrency XVI. Lecture Notes in Computer Science(), vol 13220. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-65303-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-65303-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-65302-9

  • Online ISBN: 978-3-662-65303-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics