Pages that link to "Item:Q1015394"

The following pages link to A decomposition theorem for finite persistent transition systems (Q1015394):

Displaying 8 items.

• Characterisation of the state spaces of marked graph Petri nets (Q515678) (← links)
• Using transition set sequences to partition behaviors of Petri nets (Q766188) (← links)
• Sufficient conditions for the marked graph realisability of labelled transition systems (Q1623288) (← links)
• Bounded choice-free Petri net synthesis: algorithmic issues (Q1789066) (← links)
• Synthesis of Petri nets with restricted place-environments: classical and parameterized (Q2117176) (← links)
• Synthesis and reengineering of persistent systems (Q2257983) (← links)
• The Power of Prime Cycles (Q2822651) (← links)
• A Graph-Theoretical Characterisation of State Separation (Q2971132) (← links)