The following pages link to CONCUR 2003 - Concurrency Theory (Q5900569):
Displaying 6 items.
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, (Q5327431) (← links)