The following pages link to (Q4040147):
Displaying 29 items.
- Mutex needs fairness (Q287028) (← links)
- Petri games: synthesis of distributed systems with causal memory (Q515654) (← links)
- Process semantics of general inhibitor nets (Q598184) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Trapping mutual exclusion in the box calculus (Q672869) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- Processes of membrane systems with promoters and inhibitors (Q953547) (← links)
- M-nets: a survey (Q1006339) (← links)
- A rigorous methodology for specification and verification of business processes (Q1037243) (← links)
- Elementary transition systems (Q1190485) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- A uniform approach to true-concurrency and interleaving semantics for Petri nets (Q1274975) (← links)
- Finite Petri nets as models for recursive causal behaviour (Q1318729) (← links)
- Abstract fairness and semantics (Q1391865) (← links)
- Process languages and nets (Q1575245) (← links)
- A causal semantic for time Petri nets (Q1575828) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Petri net reactive modules (Q2503287) (← links)
- A Petri net model for membrane systems with dynamic structure (Q2655493) (← links)
- Orthomodular Lattices in Occurrence Nets (Q3636845) (← links)
- On the Analysis of Petri Nets and their Synthesis from Process Languages (Q4462676) (← links)
- Arc-typed Petri Nets (Q4633168) (← links)
- Solving recursive net equations (Q4645215) (← links)
- Model checking using net unfoldings (Q5044767) (← links)
- A trace semantics for Petri Nets (Q5204350) (← links)
- Concurrency-Preserving Minimal Process Representation (Q5283215) (← links)
- Inheritance of behavior (Q5943265) (← links)
- Algebraic nets with flexible arcs (Q5958125) (← links)
