Whole-grain Petri nets and processes
From MaRDI portal
Publication:6567261
DOI10.1145/3559103MaRDI QIDQ6567261FDOQ6567261
Authors: Joachim Kock 
Publication date: 4 July 2024
Published in: Journal of the ACM (Search for Journal in Brave)
Recommendations
Cites Work
- Julia: a fresh approach to numerical computing
- Title not available (Why is that?)
- Petri nets, event structures and domains. I
- The geometry of tensor calculus. I
- Bisimulation from open maps
- The unfolding of general Petri nets
- A Survey of (∞, 1)-Categories
- A completeness theorem for open maps
- Title not available (Why is that?)
- Graphs, hypergraphs, and properads
- Feynman graphs, and nerve theorem for compact symmetric multicategories (extended abstract)
- Homotopy theory for algebras over polynomial monads
- Polynomial functors and trees
- Title not available (Why is that?)
- Configuration structures, event structures and Petri nets
- Codescent objects and coherence
- Title not available (Why is that?)
- Internal algebra classifiers as codescent objects of crossed internal categories
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Une théorie combinatoire des séries formelles
- Being Van Kampen is a universal property
- Title not available (Why is that?)
- Compositional semantics for open Petri nets based on deterministic processes
- Sequential and concurrent behaviour in Petri net theory
- Zero-safe nets: Comparing the collective and individual token approaches.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets are monoids
- Title not available (Why is that?)
- The equality problem for vector addition systems is undecidable
- Process versus unfolding semantics for Place/Transition Petri nets
- Polynomial functors and polynomial monads
- Title not available (Why is that?)
- Book review of: The Univalent Foundations Program, Homotopy type theory. Univalent foundations of mathematics
- Petri nets, algebras, morphisms, and compositionality
- Axiomatizing the algebra of net computations and processes
- Functional equations for data structures
- Decomposition spaces, incidence algebras and Möbius inversion. I: Basic theory
- Decomposition spaces, incidence algebras and Möbius inversion. II: Completeness, length filtration, and finiteness
- Homotopy linear algebra
- Decomposition spaces and restriction species
- Title not available (Why is that?)
- A compositional framework for reaction networks
- Mathematical Foundations of Computer Science 2004
- Title not available (Why is that?)
- CONCUR 2005 – Concurrency Theory
- On the semantics of place/transition Petri nets
- Functorial models for Petri nets
- Cospan construction of the graph category of Borisov and Manin
- An axiomatization of the category of Petri net computations
- Pre-nets, read ARCS and unfolding: A functorial presentation.
- Petri nets based on Lawvere theories
- Title not available (Why is that?)
- Open Petri nets
- ∞-Operads as Analytic Monads
- Structured cospans
- Symmetry in Petri nets
- Categorical Data Structures for Technical Computing
Cited In (1)
This page was built for publication: Whole-grain Petri nets and processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567261)
