Verifying Quantitative Properties of Continuous Probabilistic Timed Automata.
Marta Z. KwiatkowskaGethin NormanRoberto SegalaJeremy SprostonPublished in: CONCUR (2000)
Keyphrases
- timed automata
- model checking
- probabilistic model
- reachability analysis
- generative model
- database systems
- multiscale
- real time
- decision making
- qualitative and quantitative
- theorem prover
- data sets
- case study
- knowledge base
- data driven
- information theoretic
- desirable properties
- probability measures
- probabilistic approaches
- artificial intelligence