Conditional probabilities over probabilistic and nondeterministic systems

Authors:
Miguel E. Andrés;Peter Van Rossum
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands
Venue:
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2008

Citing 12
Cited 1

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Probabilistic verification

Information and Computation
Competitive Markov decision processes

Competitive Markov decision processes
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A Practical Secret Voting Scheme for Large Scale Elections

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Probabilistic anonymity

CONCUR 2005 - Concurrency Theory
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Counterexamples in probabilistic model checking

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Extended directed search for probabilistic timed reachability

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A formal treatment of onion routing

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Model checking conditional CSL for continuous-time Markov chains

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces the logic cpCTL, which extends the probabilistic temporal logic pCTL with conditional probability, allowing one to express that the probability that φ is true given that ψ is true is at least a. We interpret cpCTL over Markov Chain and Markov Decision Processes. While model checking cpCTL overMarkov Chains can be done with existing techniques, those techniques do not carry over to Markov Decision Processes. We present a model checking algorithm for Markov Decision Processes. We also study the class of schedulers that suffice to find the maximum and minimum probability that φ is true given that ψ is true. Finally, we present the notion of counterexamples for cpCTL model checking and provide a method for counterexample generation.