Pages that link to "Item:Q2304527"
From MaRDI portal
The following pages link to Presynthesis of bounded choice-free or fork-attribution nets (Q2304527):
Displaying 7 items.
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
- Relabelling LTS for Petri net synthesis via solving separation problems (Q2032917) (← links)
- Synthesis of (choice-free) reset nets (Q2117175) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency (Q5019696) (← links)
- A New Property of Choice-Free Petri Net Systems (Q5100751) (← links)