Login / Signup
Computing Maximally-Permissive Strategies in Acyclic Timed Automata.
Emily Clement
Thierry Jéron
Nicolas Markey
David Mentré
Published in:
FORMATS (2020)
Keyphrases
</>
timed automata
model checking
reachability analysis
np hard
theorem prover
case study
theorem proving
optimal strategy
data sets
neural network
search engine
relational databases
special case
query language
selection strategies