A Modest Approach to Checking Probabilistic Timed Automata.

Arnd Hartmanns Holger Hermanns

Published in: QEST (2009)

Keyphrases

timed automata
model checking
probabilistic model
reachability analysis
generative model
first order logic
real time systems
theorem prover
bayesian networks
data driven
theorem proving
uncertain data
information retrieval
databases
hidden markov models
probability theory
case study