The following pages link to Eike Best (Q218983):
Displaying 50 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- (Q754630) (redirect page) (← links)
- A note on the proof of a concurrent program (Q754631) (← links)
- Fairness and conspiracies (Q802310) (← links)
- Semantic independence (Q911745) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Sequential and concurrent behaviour in Petri net theory (Q1119024) (← links)
- Systematic detection of exception occurrences (Q1158746) (← links)
- Adequacy properties of path programs (Q1161276) (← links)
- Petri net semantics of priority systems (Q1190490) (← links)
- Traps characterize home states in free choice systems (Q1194324) (← links)
- Compositional generation of home states in free choice nets (Q1205188) (← links)
- Operational and denotational semantics for the box algebra (Q1274445) (← links)
- M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages (Q1284690) (← links)
- Petri net algebra (Q1573598) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Plain, bounded, reversible, persistent, and \(k\)-marked Petri nets have marked graph reachability graphs (Q1708655) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- A formal model of atomicity in asynchronous systems (Q1838831) (← links)
- The box algebra = Petri nets + process expressions (Q1854558) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- From event-oriented models to transition systems (Q2280183) (← links)
- State space axioms for T-systems (Q2340253) (← links)
- Concurrent bisimulations in Petri nets (Q2639636) (← links)
- (Q2760251) (← links)
- (Q2766552) (← links)
- Synthesis of Live and Bounded Persistent Systems (Q2803576) (← links)
- Relational Semantics Revisited (Q2810687) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Deciding Selective Declassification of Petri Nets (Q2894328) (← links)
- Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict (Q2971130) (← links)
- A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)
- A Categorical View of Timed Behaviours (Q3008110) (← links)
- (Q3030242) (← links)
- Unifying Equivalences for Higher Dimensional Automata (Q3168195) (← links)
- (Q3225713) (← links)
- (Q3313266) (← links)
- (Q3339295) (← links)
- Separability in Conflict-Free Petri Nets (Q3401931) (← links)
- Petri Net Distributability (Q3457969) (← links)
- (Q3504339) (← links)
- A Note on Persistent Petri Nets (Q3507378) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- Separability in Persistent Petri Nets (Q3569870) (← links)
- (Q3657408) (← links)
- (Q3680254) (← links)
- (Q3683545) (← links)
