Pages that link to "Item:Q6487371"
From MaRDI portal
The following pages link to On the complexity of the linear-time μ-calculus for Petri Nets (Q6487371):
Displaying 10 items.
- Reasoning about equilibria in game-like concurrent systems (Q345709) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- Strategic reasoning with a bounded number of resources: the quest for tractability (Q2238736) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Equivalence between model-checking flat counter systems and Presburger arithmetic (Q2636509) (← links)
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic (Q3447697) (← links)
- Forward analysis for WSTS. III: Karp-Miller trees (Q5114831) (← links)
- On the complexity of resource-bounded logics (Q5915568) (← links)
- Reasoning about reversal-bounded counter machines (Q6599624) (← links)