Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Essence of Petri Net Gluings (1909.03518v3)

Published 8 Sep 2019 in math.CT, cs.DC, and cs.FL

Abstract: Many categorical frameworks have been proposed to formalize the idea of gluing Petri nets with each other. Such frameworks model net gluings in terms of sharing of resources or synchronization of transitions. Interpretations given to these gluings are more or less satisfactory when we consider Petri nets with a semantics attached to them. In this work, we define a framework to compose Petri nets together in such a way that their semantics is respected. In addition to this, we show how our framework generalizes the previously defined ones.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (28)
  1. J. C. Baez. Network Theory (Part 1). available at https://johncarlosbaez.wordpress.com/2011/03/04/network-theory-part-1/.
  2. J. C. Baez. Quantum techniques for reaction networks. Advances in Mathematical Physics, 2018:1–9, November 2018.
  3. Categories of nets. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 1–13, Los Alamitos, CA, USA, jul 2021. IEEE Computer Society.
  4. J. C. Baez and J. Master. Open Petri nets. Mathematical Structures in Computer Science, 30(3):314–341, 2020.
  5. Encoding asynchronous interactions using open petri nets. In CONCUR 2009 - Concurrency Theory, pages 99–114. Springer Berlin Heidelberg, 2009.
  6. Modular encoding of synchronous and asynchronous interactions using open petri nets. Science of Computer Programming, 109:96–124, October 2015.
  7. Pre-nets, Read Arcs and Unfolding: A Functorial Presentation. In Martin Wirsing, Dirk Pattinson, and Rolf Hennicker, editors, Recent Trends in Algebraic Development Techniques, volume 2755, pages 145–164. Springer Berlin Heidelberg.
  8. Connector algebras for C/E and P/T nets’ interactions. Logical Methods in Computer Science, 9(3), September 2013.
  9. Functorial models for Petri Nets. Inf. Comput., 170(2):207–236, 2001.
  10. B. Fong. The Algebra of Open and Interconnected Systems. Phd thesis.
  11. B. Fong. Decorated Cospans. Theory and Applications of Categories, 30(33):1096–1120, 2015.
  12. F. Genovese. Behavioral Programming with Petri Nets a la Functional Way:  Smart Contracts.
  13. Computational Petri Nets: Adjunctions Considered Harmful.
  14. A categorical semantics for hierarchical petri nets. Electronic Proceedings in Theoretical Computer Science, 350:51–68, December 2021.
  15. Nets with mana: a framework for chemical reaction modelling. In Graph Transformation, pages 185–202. Springer International Publishing, 2021.
  16. A categorical semantics for bounded petri nets. Electronic Proceedings in Theoretical Computer Science, 372:59–71, November 2022.
  17. F. Genovese and David I. Spivak. A categorical semantics for Guarded Petri Nets. pages 57–74, 2020.
  18. A categorical semantics for guarded petri nets. In Graph Transformation, pages 57–74. Springer International Publishing, 2020.
  19. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637–688, 2001.
  20. Representing place/transition nets in Span(Graph). In Michael Johnson, editor, Algebraic Methodology and Software Technology, 6th International Conference, AMAST ’97, Sydney, Australia, December 13-17, 1997, Proceedings, volume 1349 of Lecture Notes in Computer Science, pages 322–336. Springer, 1997.
  21. D. Licata. Running Circles Around (In) Your Proof Assistant; or, Quotients that Compute.
  22. J. Master. Petri nets based on Lawvere theories. Mathematical Structures in Computer Science, 30(7):833–864, 2020.
  23. J. Meseguer and U. Montanari. Petri nets are monoids. 88(2):105–155.
  24. Profunctor optics: Modular data accessors. The Art, Science, and Engineering of Programming, 1(2), April 2017.
  25. V. Sassone. On the Category of Petri Net Computations. In Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors, TAPSOFT ’95: Theory and Practice of Software Development, volume 915, pages 334–348. Springer Berlin Heidelberg.
  26. P. Sobociński and Owen Stephens. Penrose: Putting Compositionality to Work for Petri Net Reachability. In Reiko Heckel and Stefan Milius, editors, Algebra and Coalgebra in Computer Science, volume 8089, pages 346–352. Springer Berlin Heidelberg.
  27. P. Sobociński and Owen Stephens. Reachability via Compositionality in Petri nets.
  28. Statebox Team. The Mathematical Specification of the Statebox Language.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now