Effective Definability of the Reachability Relation in Timed Automata.

Martin Fränzle Karin Quaas Mahsa Shirmohammadi James Worrell

Published in: CoRR (2019)

Keyphrases

timed automata
relational databases
reachability analysis
model checking
fixed point
theorem proving
data sets
information retrieval
feature selection
decision trees
computationally efficient
first order logic