The following pages link to APT (Q34960):
Displaying 30 items.
- Over-approximative Petri net synthesis for restricted subclasses of nets (Q1647718) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Relabelling LTS for Petri net synthesis via solving separation problems (Q2032917) (← links)
- Lifted structural invariant analysis of Petri net product lines (Q2096429) (← 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 and reengineering of persistent systems (Q2257983) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← 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)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
- Incremental Process Discovery using Petri Net Synthesis (Q4601117) (← links)
- (Q4608667) (← links)
- Simultaneous Petri Net Synthesis (Q4621223) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (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)
- Symbolic and Structural Model-Checking (Q5025068) (← 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)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)
- Structural Reductions Revisited (Q5100759) (← links)
- k-Bounded Petri Net Synthesis from Modal Transition Systems. (Q5111618) (← links)
- (Q5216152) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
- Publication:5100759 (← links)
