On finite-state approximants for probabilistic computation tree logic.
Michael HuthPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- finite state
- model checking
- computation tree logic
- temporal logic
- markov chain
- markov decision processes
- model checker
- transition systems
- formal verification
- temporal properties
- bounded model checking
- formal specification
- epistemic logic
- average cost
- partially observable markov decision processes
- probabilistic context free grammars
- probabilistic model
- bayesian networks
- learning algorithm
- concurrent systems
- search algorithm