The following pages link to Elementary transition systems (Q1190485):
Displayed 22 items.
- Transition systems without transitions (Q557786) (← links)
- An event structure semantics for general Petri nets (Q672871) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- Regions of Petri nets with a/sync connections (Q714824) (← links)
- Applying regions (Q728281) (← links)
- A characterization of set representable labeled partial 2-structures through decompositions (Q1173685) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Elementary transition systems and refinement (Q1323371) (← links)
- Some complexity results on transition systems and elementary net systems (Q1346631) (← links)
- An algebraic model of observable properties in distributed systems (Q1853608) (← links)
- The synthesis problem of Petri nets (Q1901703) (← links)
- Trace nets and process automata (Q1902303) (← links)
- Stability of regional orthomodular posets under synchronisation and refinement (Q2032837) (← links)
- Synthesising elementary net systems with localities (Q2077411) (← links)
- Event-based functional decomposition (Q2304530) (← links)
- A theoretical investigation of regular equivalences for fuzzy graphs (Q2379343) (← links)
- Rough set models of<i>Physarum</i>machines (Q2943480) (← links)
- Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
- Modeling Distributed Private Key Generation by Composing Petri Nets (Q3452467) (← links)
- Transformations in Reconfigurable Place/Transition Systems (Q3507359) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Synthesis of nets with inhibitor arcs (Q6044115) (← links)