Unifying Petri nets with restricted occurrence rule using partial algebra
From MaRDI portal
Recommendations
Cites work
- A comparison of Petri net semantics under the collective token philosophy
- Algebraic models for contextual nets
- An algebraic description of system behaviours
- An axiomatization of the category of Petri net computations
- Axiomatizing the algebra of net computations and processes
- Axioms for contextual net processes
- Behaviours of concurrent systems
- Contextual nets
- 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 1455622 (Why is no real title available?)
- Parameterized net classes: A uniform approach to Petri net classes
- Petri nets are monoids
- Petri nets over partial algebra
- Place/transition Petri nets
- Process semantics of P/T-nets with inhibitor arcs
- Process semantics of Petri nets over partial algebra
- Reasoning about algebraic generalisation of Petri nets
- 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)