Computing maximally-permissive strategies in acyclic timed automata.

Emily Clement Thierry Jéron Nicolas Markey David Mentré

Published in: CoRR (2020)

Keyphrases

timed automata
model checking
theorem prover
reachability analysis
np hard
first order logic
np complete
search strategies
theorem proving