The following pages link to (Q4055201):
Displayed 24 items.
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
- A decomposition theorem for finite persistent transition systems (Q1015394) (← links)
- Simulation, reduction and preservation of correctness properties of parallel systems (Q1054477) (← links)
- A context dependent equivalence between processes (Q1088404) (← links)
- Regularity and firing sequences of computation graphs (Q1159465) (← links)
- Causal automata (Q1194329) (← links)
- On reduction of asynchronous systems (Q1241274) (← links)
- Synchronization and computing capabilities of linear asynchronous structures (Q1242906) (← links)
- (A-)synchronous (non)-deterministic cell spaces simulating each other (Q1253921) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Factorisation of transition systems (Q1647774) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Modular implementation of concurrency (Q1838041) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- An extension of the taxonomy of persistent and nonviolent steps (Q2293146) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- State space axioms for T-systems (Q2340253) (← links)
- Execution termination and computation determinacy of data-flow program nets (Q2638758) (← links)
- A Note on Persistent Petri Nets (Q3507378) (← links)
- Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855) (← links)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057) (← links)
- Step Persistence in the Design of GALS Systems (Q5300872) (← links)