Pages that link to "Item:Q1096388"

The following pages link to Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states (Q1096388):

Displaying 20 items.

• On selective unboundedness of VASS (Q355513) (← links)
• Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
• A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems (Q1097037) (← links)
• Completeness results for conflict-free vector replacement systems (Q1113674) (← links)
• Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
• The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
• A unified approach for deciding the existence of certain petri net paths (Q1184737) (← links)
• Normal and sinkless Petri nets (Q1208921) (← links)
• Deciding a class of path formulas for conflict-free Petri nets (Q1364130) (← links)
• On the finite containment problem for Petri nets (Q1819937) (← links)
• A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
• Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)
• On the Containment Problem for Linear Sets (Q3304154) (← links)
• Hyper-Ackermannian bounds for pushdown vector addition systems (Q4635648) (← links)
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (Q4635789) (← links)
• Separability of Reachability Sets of Vector Addition Systems (Q4636622) (← links)
• The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)
• The Complexity of Reachability in Affine Vector Addition Systems with States (Q5145633) (← links)
• (Q5155664) (← links)