The following pages link to (Q5357699):
Displaying 8 items.
- Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
- Factorisation of transition systems (Q1647774) (← links)
- Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← 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)
- Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems (Q3297771) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
