The following pages link to (Q4484486):
Displaying 4 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)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)