9- https://doi.org/10.1007/978-3-642-28756-5_24
Verifying pCTL Model Checking
- Jan 1, 2012
- Johannes Hölzl +1 more
Abstract
Abstract Probabilistic model checkers like PRISM check the satisfiability of probabilistic CTL (pCTL) formulas against discrete-time Markov chains. We prove soundness and completeness of their underlying algorithm in Isabelle/HOL. We define Markov chains given by a transition matrix and formalize the corresponding probability measure on sets of paths. The formalization of pCTL formulas includes unbounded cumulated rewards.KeywordsMarkov ChainModel CheckProbability SpaceProof AssistantLinear Equation SystemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- # Discrete-time Markov Chains
- # Sets Of Paths
- # Transition Matrix
- # Probability Measure
- # CTL Formulas
- # Markov Chains
- # pCTL Formulas
- # Probabilistic CTL
- # Discrete-time Markov
- # Model Checkers
