Weak bisimulation for Probabilistic Timed Automata.
Ruggero LanotteAndrea Maggiolo-SchettiniAngelo TroinaPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- timed automata
- model checking
- reachability analysis
- theorem prover
- bayesian networks
- probabilistic model
- first order logic
- data driven
- probabilistic approaches
- theorem proving
- data mining
- probabilistic networks
- uncertain data
- temporal logic
- information theoretic
- context sensitive
- posterior probability
- similarity measure
- database