Unifying Petri nets with restricted occurrence rule using partial algebra
From MaRDI portal
Recommendations
Cites work
- An algebraic description of system behaviours
- An axiomatization of the category of Petri net computations
- Axiomatizing the algebra of net computations and processes
- Behaviours of concurrent systems
- Contextual nets
- scientific article; zbMATH DE number 1670822 (Why is no real title available?)
- scientific article; zbMATH DE number 1696454 (Why is no real title available?)
- scientific article; zbMATH DE number 1696460 (Why is no real title available?)
- scientific article; zbMATH DE number 1223715 (Why is no real title available?)
- scientific article; zbMATH DE number 1236364 (Why is no real title available?)
- scientific article; zbMATH DE number 1236370 (Why is no real title available?)
- scientific article; zbMATH DE number 1302043 (Why is no real title available?)
- scientific article; zbMATH DE number 1302631 (Why is no real title available?)
- scientific article; zbMATH DE number 1341760 (Why is no real title available?)
- scientific article; zbMATH DE number 1973122 (Why is no real title available?)
- scientific article; zbMATH DE number 1973123 (Why is no real title available?)
- scientific article; zbMATH DE number 1455622 (Why is no real title available?)
- Petri nets are monoids
- Semantics of inhibitor nets
- Sequential and concurrent behaviour in Petri net theory
This page was built for publication: Unifying Petri nets with restricted occurrence rule using partial algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923515)