Pages that link to "Item:Q911308"
From MaRDI portal
The following pages link to Partial (set) 2-structures. II: State spaces of concurrent systems (Q911308):
Displaying 44 items.
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Transition systems without transitions (Q557786) (← links)
- An event structure semantics for general Petri nets (Q672871) (← 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)
- Elementary transition systems (Q1190485) (← links)
- An algebraic characterisation of elementary net system (observable) state space (Q1203118) (← links)
- Elementary transition systems and refinement (Q1323371) (← links)
- Clans and regions in 2-structures (Q1329728) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- Some complexity results on transition systems and elementary net systems (Q1346631) (← links)
- The synthesis problem for elementary net systems is NP-complete (Q1389765) (← links)
- Identification of biological transition systems using meta-interpreted logic programs (Q1621890) (← links)
- Discovering workflow nets using integer linear programming (Q1639990) (← links)
- An algebraic model of observable properties in distributed systems (Q1853608) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- The synthesis problem of Petri nets (Q1901703) (← links)
- Stability of regional orthomodular posets under synchronisation and refinement (Q2032837) (← links)
- Synthesising elementary net systems with localities (Q2077411) (← links)
- Topics in region theory and synthesis problems (Q2117149) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Synthesis and reengineering of persistent systems (Q2257983) (← links)
- A novel method for deadlock prevention of AMS by using resource-oriented Petri nets (Q2279726) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Petri Net Synthesis for Restricted Classes of Nets (Q2822652) (← links)
- On Orthomodular Posets Generated by Transition Systems (Q2825351) (← links)
- On Distributed Monitoring and Synthesis (Q3195680) (← links)
- Automated Synthesis of Distributed Controllers (Q3449462) (← links)
- Tissue Systems and Petri Net Synthesis (Q3452477) (← links)
- On the Synthesis of Zero-Safe Nets (Q3507377) (← links)
- Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
- Theory of 2-structures (Q4645162) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Discovering Block-Structured Process Models from Incomplete Event Logs (Q5166758) (← links)
- A trace semantics for Petri Nets (Q5204350) (← links)
- Synthesis of Nets with Step Firing Policies (Q5900140) (← links)
- On the Petri net realization of context-free graphs (Q5941208) (← links)
- Generation of synchronizing state machines from a transition system: a region-based approach (Q6100077) (← links)
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns (Q6189320) (← links)
- Strategies for minimising the synthesised ENL-systems (Q6550565) (← links)
- Implementable strategies for a two-player asynchronous game on Petri nets (Q6550567) (← links)
