The following pages link to (Q4818858):
Displaying 5 items.
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← 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)
