The following pages link to (Q4508303):
Displaying 10 items.
- Better abstractions for timed automata (Q342707) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- On timed alternating simulation for concurrent timed games (Q715043) (← links)
- State explosion in almost-sure probabilistic reachability (Q846015) (← 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)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Characteristic Formulae for Timed Automata (Q2729632) (← links)
- Keeping Secrets in Resource Aware Components (Q2870285) (← links)
