An axiomatization of the algebra of Petri net concatenable processes

DOI10.1016/S0304-3975(96)80709-2zbMath0874.68224OpenAlexW4256193793MaRDI QIDQ672052

Vladimiro Sassone

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)80709-2

zbMATH Keywords

symmetric monoidal categoryaxiomatic theoryconcatenable processespetri net

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Executions in (Semi-)Integer Petri Nets are Compact Closed Categories, Open Petri nets, Concurrency for Graph Grammars in a Petri net shell, Petri nets based on Lawvere theories, Petri Nets Are Dioids, Normal forms for algebras of connections., Relaxed models for rewriting logic, Zero-safe nets: Comparing the collective and individual token approaches., Functorial models for Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Petri nets are monoids
• Sequential and concurrent behaviour in Petri net theory
• On MacLane's conditions for coherence of natural associativities, commutativities, etc
• The non-sequential behaviour of Petri nets
• Axiomatizing Petri net concatenable processes
• On the category of Petri net computations
• Categorical algebra
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES