Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra
From MaRDI portal
Publication:4923515
DOI10.1016/S1571-0661(04)80950-2zbMath1263.68107MaRDI QIDQ4923515
Robert Lorenz, Gabriel Juhás, Jörg Desel
Publication date: 24 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Petri nets are monoids
- Sequential and concurrent behaviour in Petri net theory
- Behaviours of concurrent systems
- An algebraic description of system behaviours
- Axiomatizing the algebra of net computations and processes
- Contextual nets
- Semantics of inhibitor nets
- An axiomatization of the category of Petri net computations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item