The following pages link to Petri net synthesis (Q897109):
Displayed 39 items.
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Applying regions (Q728281) (← links)
- Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
- Factorisation of transition systems (Q1647774) (← links)
- Signal set tissue systems and overlapping localities (Q1682863) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Stability of regional orthomodular posets under synchronisation and refinement (Q2032837) (← links)
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
- Synthesising elementary net systems with localities (Q2077411) (← links)
- Topics in region theory and synthesis problems (Q2117149) (← links)
- Edge, event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable (Q2117174) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues (Q2165238) (← links)
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior (Q2165244) (← links)
- Solving high-level Petri games (Q2182671) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Petri Net Synthesis for Restricted Classes of Nets (Q2822652) (← links)
- A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)
- Synthesis of Petri Nets with Whole-Place Operations and Localities (Q3179395) (← links)
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
- Discovering Object-centric Petri Nets (Q4988950) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- (Q5009430) (← links)
- (Q5019696) (← links)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory (Q5025067) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues (Q5044399) (← links)
- Automated Repair of Process Models Using Non-local Constraints (Q5100758) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)
- Synthesis of Persistent Systems (Q5166759) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
- Generation of synchronizing state machines from a transition system: a region-based approach (Q6100077) (← links)