Bisimulation through probabilistic testing
Information and Computation
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model checking for probability and time: from theory to practice
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Hintikka Games for PCTL on Labeled Markov Chains
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Performance Evaluation
Characterization and computation of infinite-horizon specifications over Markov processes
Theoretical Computer Science
| Hi-index | 0.00 |
Three-valued Markov chains and their PCTL semantics abstract - via probabilistic simulations - labeled Markov chains and their usual PCTL semantics. This abstraction framework is complete for a PCTL formula if all labeled Markov chains that satisfy said formula have a finite-state abstraction that satisfies it in its abstract semantics. We show that not all PCTL formulae are complete for this abstraction framework. But PCTL formulae whose path modalities occur in a suitable combination of negation polarity and threshold type are proved to be complete, where abstractions are bounded, 3-valued unfoldings of their concrete labeled Markov chains. This set of complete PCTL formulae subsumes widely used PCTL patterns.