On Conciseness of Extensions of Timed Automata.

Patricia Bouyer Fabrice Chevalier

Published in: J. Autom. Lang. Comb. (2005)

Keyphrases

timed automata
model checking
reachability analysis
theorem proving
theorem prover
real time systems
first order logic
neural network
temporal logic
efficient implementation
data sets
hidden markov models
default logic
default theories