Pages that link to "Item:Q1183417"
From MaRDI portal
The following pages link to The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417):
Displaying 8 items.
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- Bound problems in predicate networks and networks of weakly initial automata (Q1974335) (← links)
- Problematic configurations and choice-join pairs on Mono-T-Semiflow nets: towards the characterization of behavior-structural properties (Q2197578) (← links)
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable (Q2317836) (← links)
- Complexity results for problems of communication-free Petri nets and related formalisms (Q2805419) (← links)
- Boundedness problems for jumping Petri nets (Q2914604) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)