Pages that link to "Item:Q1819937"
From MaRDI portal
The following pages link to On the finite containment problem for Petri nets (Q1819937):
Displaying 12 items.
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Petri nets and large finite sets (Q1060848) (← links)
- Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388) (← links)
- Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Complexity hierarchies beyond elementary (Q2828216) (← links)
- Boundedness problems for jumping Petri nets (Q2914604) (← links)
- Multiply-Recursive Upper Bounds with Higman’s Lemma (Q3012939) (← links)
- (Q3795192) (← links)
- The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
- A Framework for Classical Petri Net Problems: Conservative Petri Nets as an Application (Q5166771) (← links)