The following pages link to (Q3795192):
Displayed 20 items.
- A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets (Q557805) (← links)
- Step failures semantics and a complete proof system (Q582133) (← links)
- A multiset semantics for the pi-calculus with replication (Q672867) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- Some behavioural aspects of net theory (Q913516) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- Branching processes of Petri nets (Q1175711) (← 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)
- Nested-unit Petri nets (Q2423743) (← links)
- Concurrent bisimulations in Petri nets (Q2639636) (← links)
- Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
- Language Representability of Finite P/T Nets (Q3460873) (← links)
- Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets (Q3613087) (← links)
- Solving recursive net equations (Q4645215) (← links)
- An algebraic semantics for hierarchical P/T nets (Q5096359) (← links)
- Functional equivalences of Petri nets (Q5096374) (← links)
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus (Q5096391) (← links)
- Compositional process semantics of Petri Boxes (Q5890051) (← links)