Robustness and Implementability of Timed Automata.

Martin De Wulf Laurent Doyen Nicolas Markey Jean-François Raskin

Published in: FORMATS/FTRTFT (2004)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
computational efficiency
databases
decision trees
three dimensional
high robustness
theorem proving
first order logic
real time systems
low cost
software engineering
relational databases
database systems
machine learning