The following pages link to Simultaneous Petri Net Synthesis (Q4621223):
Displaying 15 items.
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Distributing finite automata through Petri net synthesis (Q1849592) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- The synthesis problem of Petri nets (Q1901703) (← links)
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Relabelling LTS for Petri net synthesis via solving separation problems (Q2032917) (← 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 and reengineering of persistent systems (Q2257983) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Design of grid structures on the basis of transition systems with the substantiation of the correctness of their operation (Q2362821) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Stratified petri nets (Q5055926) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)