Pages that link to "Item:Q5268428"
From MaRDI portal
The following pages link to Conditions for Petri Net Solvable Binary Words (Q5268428):
Displaying 8 items.
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond (Q2032839) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Characterising Petri Net Solvable Binary Words (Q2822650) (← links)
- The Power of Prime Cycles (Q2822651) (← links)
- A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)
- Target-oriented Petri Net Synthesis (Q4988954) (← links)
- Investigating Reversibility of Steps in Petri Nets (Q5025059) (← links)
- Conditions for Petri Net Solvable Binary Words (Q5268428) (← links)
