Fetching the paper…
Reading the bibliography…
The reachability semantics for Petri nets can be studied using open Petri nets.
J. Master, Petri nets based on Lawvere theories, Math. Struct. Comp. Sci
1904
Earlier work this paper cites.
J. C. Baez and K. Courser, Structured cospans, Theor. Appl. Categ
1911
Earlier work this paper cites.
P. Degano, J. Meseguer and U. Montanari, Axiomatizing net computations and processes, in Logic in Computer Science, 1989
1954
Earlier work this paper cites.
C. Ehresmann, Catégories structurées III: Quintettes et applications covariantes, Cah. Top. Géom. Diff
1963
Earlier work this paper cites.
C. Ehresmann, Catégories et Structures,
1965
Earlier work this paper cites.
P. J. Freyd and G. M. Kelly, Categories of continuous functors, I, Jour. Pure Appl. Alg
1972
Earlier work this paper cites.
R. Lipton, The reachability problem is exponential-space-hard, Tech. Rep
1976
Earlier work this paper cites.
J. L. Peterson, Petri Net Theory and the Modeling of Systems
1981
Earlier work this paper cites.
E. Mayr, An algorithm for the general Petri net reachability problem, SIAM J. Comput
1984
Earlier work this paper cites.
R. M. Burstall, and D. E. Rydeheard, Computational Category Theory
1988
Earlier work this paper cites.
J. Meseguer and U. Montanari, Petri nets are monoids, Information and Computation
1990
Earlier work this paper cites.
V. Sassone, On the category of Petri net computations, in CAAP’92: 17th Colloquium on Trees in Algebra and Programming
1992
Earlier work this paper cites.
V. Sassone, Strong concatenable processes: an approach to the category of Petri net computations, BRICS Report Series
1994
Earlier work this paper cites.
V. Sassone, An axiomatization of the algebra of Petri net concatenable processes, Theor. Comput. Sci
1996
Cited alongside, same era.
B. Day and R. Street, Monoidal bicategories and Hopf algebroids, Adv. Math
1997
Cited alongside, same era.
S. Mac Lane, Categories for the Working Mathematician
1998
Cited alongside, same era.
M. Grandis and R. Paré, Limits in double categories, Cah. Top. Géom. Diff
1999
Cited alongside, same era.
R. Bruni, J. Meseguer, U. Montanari and V. Sassone, Functorial models for Petri nets, Information and Computation
2001
Cited alongside, same era.
R. Bruni, J. Meseguer and U. Montanari, Symmetric monoidal and cartesian double categories as a semantic framework for tile logic, Math. Struct. Comp. Sci
C. Girault and R. Valk, Petri Nets for Systems Engineering: a Guide to Modeling, Verification, and Applications
2013
Later among the works it cites.
J. Rathke, P. Sobociński and O. Stephens, Compositional reachability in Petri nets, in International Workshop on Reachability Problems
2014
Later among the works it cites.
P. Baldan, F. Bonchi, F. Gadducci and G. V. Monreale, Modular encoding of synchronous and asynchronous interactions using open Petri nets, Sci. Comp. Prog
2015
Later among the works it cites.
2015
Later among the works it cites.
M. Stay, Compact closed bicategories, Theor. Appl. Categ
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
M. Grandis and R. Paré, Adjoints for double categories, Cah. Top. Géom. Diff
2004
Cited alongside, same era.
P. Baldan, A. Corradini, H. Ehrig, and R. Heckel, Compositional semantics for open Petri nets based on deterministic processes, Math. Str. Comp. Sci
2005
Cited alongside, same era.
V. Sassone and P. Sobociński, A congruence for Petri nets, Electron. Notes Theor. Comput. Sci
2005
Cited alongside, same era.
2009
Cited alongside, same era.
K. Jensen and L. M. Kristensen, Coloured Petri Nets: Modelling and Validation of Concurrent Systems
2009
Cited alongside, same era.
R. Bruni, H. C. Melgratti and U. Montanari, A connector algebra for P/T nets interactions, in Concurrency Theory (CONCUR ‘11)
2011
Cited alongside, same era.
Later among the works it cites.
J. C. Baez and B. Pollard, A compositional framework for reaction networks, Rev. Math. Phys
2017
Later among the works it cites.
F. Clerc, H. Humphrey and P. Panangaden, Bicategories of Markov processes, in Models, Algorithms, Logics and Tools
2017
Later among the works it cites.
K. Courser, A bicategory of decorated cospans, Theor. Appl. Categ
2017
Later among the works it cites.
R. Gorrieri, Process Algebras for Petri Nets—The Alphabetization of Distributed Systems
2017
Later among the works it cites.
J. C. Baez and K. Courser, Coarse-graining open Markov processes, Theor. Appl. Categ
2018
Closest in time.
E. Lerman, Networks of open systems, J. Geom. Phys
2018
Closest in time.