Skip to main content
SpringerLink
Log in

Multilabeled Petri Nets

  • Conference paper
  • First Online:
Book cover Formal Aspects of Component Software (FACS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12018))

Included in the following conference series:

  • 425 Accesses

Abstract

We introduce multilabeled Petri nets as an inherently parallel generalization of constraint automata. Composition of multilabeled nets does not suffer from state-space explosions, which makes them an adequate intermediate representation for code generation. We present also an abstraction operator for multilabeled nets that eliminates internal transitions, which optimizes the execution of multilabeled nets.

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. Anisimov, N.A., Golenkov, E.A., Kharitonov, D.I.: Compositional petri net approach to the development of concurrent and distributed systems. Program. Comput. Softw. 27(6), 309–319 (2001). https://doi.org/10.1023/A:1012758417962

  2. Arbab, F.: Puff, the magic protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169–206. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24933-4_9

  3. Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006). https://doi.org/10.1016/j.scico.2005.10.008

  4. Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), 11–15 September 2006, Pune, India, pp. 3–12. IEEE Computer Society (2006). https://doi.org/10.1109/SEFM.2006.27

  5. 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 

  6. Best, E., Devillers, R., Hall, J.G.: The box calculus: a new causal algebra with multi-label communication. In: Rozenberg, G. (ed.) Advances in Petri Nets 1992. LNCS, vol. 609, pp. 21–69. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55610-9_167

    Chapter  Google Scholar 

  7. Bruni, R., Montanari, U.: Zero-safe nets, or transition synchronization made simple. Electr. Notes Theor. Comput. Sci. 7, 55–74 (1997). https://doi.org/10.1016/S1571-0661(05)80466-9

  8. Fehling, R.: A concept of hierarchical Petri nets with building blocks. In: Rozenberg, G. (ed.) ICATPN 1991. LNCS, vol. 674, pp. 148–168. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-56689-9_43

    Chapter  Google Scholar 

  9. van Glabbeek, R., Vaandrager, F.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol. 259, pp. 224–242. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-17945-3_13

    Chapter  Google Scholar 

  10. Goltz, U.: On representing CCS programs by finite petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds.) MFCS 1988. LNCS, vol. 324, pp. 339–350. Springer, Heidelberg (1988). https://doi.org/10.1007/BFb0017157

    Chapter  Google Scholar 

  11. Jongmans, S.S.T.Q.: Automata-theoretic protocol programming. Ph.D. thesis, Centrum Wiskunde & Informatica (CWI), Faculty of Science, Leiden University (2016)

    Google Scholar 

  12. Jongmans, S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comp. Sci. 22(1), 201–251 (2012). https://doi.org/10.7561/SACS.2012.1.201

  13. Jongmans, S.T.Q., Kappé, T., Arbab, F.: Constraint automata with memory cells and their composition. Sci. Comput. Program. 146, 50–86 (2017). https://doi.org/10.1016/j.scico.2017.03.006

  14. Kotov, V.E.: An algebra for parallelism based on petri nets. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 39–55. Springer, Heidelberg (1978). https://doi.org/10.1007/3-540-08921-7_55

    Chapter  Google Scholar 

  15. Mazurkiewicz, A.: Introduction to trace theory. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, Chap. 1, pp. 3–41. World Scientific, Singapore (1995). https://doi.org/10.1142/9789814261456_0001

  16. Meseguer, J., Montanari, U.: Petri nets are monoids. Inf. Comput. 88(2), 105–155 (1990). https://doi.org/10.1016/0890-5401(90)90013-8

  17. Pratt, V.: Modeling concurrency with partial orders. Int. J. Parallel Program. 15(1), 33–71 (1986). https://doi.org/10.1007/BF01379149

  18. Reisig, W.: Understanding Petri Nets - Modeling Techniques, Analysis Methods. Case Studies. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-33278-4

  19. Rozenberg, G. (ed.): Advances in Petri Nets 1992, The DEMON Project, LNCS, vol. 609. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55610-9

  20. Taubner, D.A.: Finite Reresentations of CCS and TCSP Programs by Automata and Petri Nets. LNCS, vol. 369. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51525-9

    Book  MATH  Google Scholar 

  21. Vogler, W., Wollowski, R.: Decomposition in asynchronous circuit design. In: Cortadella, J., Yakovlev, A., Rozenberg, G. (eds.) Concurrency and Hardware Design, Advances in Petri Nets. LNCS, vol. 2549, pp. 152–190. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-36190-1_5

  22. Wimmel, H.: Eliminating internal behaviour in petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 411–425. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27793-4_23

    Chapter  MATH  Google Scholar 

  23. Winskel, G.: Petri nets, algebras, morphisms, and compositionality. Inf. Comput. 72(3), 197–238 (1987). https://doi.org/10.1016/0890-5401(87)90032-0

Download references

Author information

Authors and Affiliations

  1. Leiden University, Leiden, Netherlands

    Kasper Dokter

Authors
  1. Kasper Dokter
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kasper Dokter .

Editor information

Editors and Affiliations

  1. CWI, University of Leiden, Leiden, The Netherlands

    Farhad Arbab

  2. Open University of the Netherlands, Heerlen, The Netherlands

    Sung-Shik Jongmans

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dokter, K. (2020). Multilabeled Petri Nets. In: Arbab, F., Jongmans, SS. (eds) Formal Aspects of Component Software. FACS 2019. Lecture Notes in Computer Science(), vol 12018. Springer, Cham. https://doi.org/10.1007/978-3-030-40914-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-40914-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-40913-5

  • Online ISBN: 978-3-030-40914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation