POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of stochastic games
Information and Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Competitive Markov decision processes
Competitive Markov decision processes
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Temporal Logics for the Specification of Performance and Reliability
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Abstract Interpretation of Probabilistic Semantics
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Theoretical Computer Science
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Cost Analysis of Games, Using Program Logic
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Memoryless Strategies for Stochastic Games via Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
Performance Evaluation
Characterising probabilistic processes logically
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Probabilistic modal µ-calculus with independent product
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Model checking the quantitative µ-calculus on linear hybrid systems
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Quantitative µ-calculus analysis of power management in wireless networks
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Quantitative refinement and model checking for the analysis of probabilistic systems
FM'06 Proceedings of the 14th international conference on Formal Methods
Of probabilistic wp and CSP - and compositionality
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Automatic verification of competitive stochastic systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A proof system for compositional verification of probabilistic concurrent processes
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
The μ-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic (universal) and angelic (existential) choice; its quantitative generalization qMμ extends to include probabilistic choice.We make two major contributions to the theory of such systems. The first is to show that for a finite-state system, the logical interpretation of qMμ, via fixed points in a domain of real-valued functions into [0, 1], is equivalent to an operational interpretation given as a turn-based gambling game between two players.The second contribution is to show that each player in the gambling game has an optimal memoryless strategy---that is, a strategy which is independent of the game's history, and with which a player can achieve his optimal expected reward however his opponent chooses to play. Moreover, since qMμ is expressive enough to encode stochastic parity games, our result implies the existence of memoryless strategies in that framework, as well.As an additional feature, we include an extensive case study demonstrating the aforementioned duality between games and logic. Among other things, it shows that the use of algorithmic verification techniques is mathematically justified in the practical computation of probabilistic system properties.