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 9 items.

• 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)
• 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)
• The Parametric Complexity of Lossy Counter Machines (Q5092331) (← links)