Pages that link to "Item:Q2805419"
From MaRDI portal
The following pages link to Complexity results for problems of communication-free Petri nets and related formalisms (Q2805419):
Displaying 6 items.
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming (Q1197993) (← links)
- Context-free commutative grammars with integer counters and resets (Q2636518) (← links)
- Approximating Petri net reachability along context-free traces (Q2911620) (← links)
- (Q4527145) (← links)
- Flatness and Complexity of Immediate Observation Petri Nets (Q5089312) (← links)