An axiomatization of the category of Petri net computations

DOI10.1017/S096012959700248XzbMath0916.68105MaRDI QIDQ4236218

Vladimiro Sassone

Publication date: 22 March 1999

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

Petri netsreplete imagestrongly concatenable process

Mathematics Subject Classification ID

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

Related Items (5)

Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Open Petri nets ⋮ Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra ⋮ Petri Nets Are Dioids ⋮ Functorial models for Petri nets

This page was built for publication: An axiomatization of the category of Petri net computations