Finite-state abstractions for probabilistic computation tree logic
Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Imperial College London
2011
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.528726 |