Login / Signup
A Kleene-Schützenberger theorem for weighted timed automata.
Manfred Droste
Karin Quaas
Published in:
Theor. Comput. Sci. (2011)
Keyphrases
</>
timed automata
model checking
reachability analysis
theorem prover
propositional logic
theorem proving
first order logic
real time systems
regular expressions
temporal logic
computer vision
databases
data sets
reinforcement learning
weighted sum
decision making
von neumann