Removing epsilon-Transitions in Timed Automata.

Volker Diekert Paul Gastin Antoine Petit

Published in: STACS (1997)

Keyphrases

timed automata
model checking
reachability analysis
theorem prover
theorem proving
first order logic
sample complexity
complexity analysis
real time systems
databases
neural network
feature selection
bayesian networks
multiresolution
temporal logic