Games, Probability and the Quantitative µ-Calculus qMµ

The µ-calculus is a powerful tool for specifying and verifying transition systems, including those with demonic (universal) and angelic (existential) choice; its quantitative generalisation qMµ extends that to probabilistic choice. We show for a finite-state system that the straightforward denotational interpretation of the quantitative µ-calculus is equivalent to an operational interpretation given as a turn-based gambling game between two players. Kozen defined the standard Boolean-typed calculus denotationally; later Stirling gave it an operational interpretation as a turn-based game between two players, and showed the two interpretations equivalent. By doing the same for the quantitative real-typed calculus, we set it on a par with the standard calculus, in that it too can benefit from a solid interface linking the logical and operational frameworks. Stirling's game analogy, as an aid to intuition, continues in the more general context to provide a surprisingly practical specification tool, meeting for example Vardi's challenge to "figure out the meaning of AFAXp" as a branching-time formula. We also show that memoriless strategies suffice for achieving the minimax value of a quantitative game, when the state space is finite.

[1]  Rance Cleaveland,et al.  Probabilistic Temporal Logics via the Modal Mu-Calculus , 1999, FoSSaCS.

[2]  Rupak Majumdar,et al.  Quantitative solution of omega-regular games380872 , 2001, STOC '01.

[3]  Carroll Morgan,et al.  A Probabilistic Temporal Calculus Based on Expectations , 1997 .

[4]  Luca de Alfaro,et al.  Computing Minimum and Maximum Reachability Times in Probabilistic Systems , 1999, CONCUR.

[5]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[6]  David Monniaux,et al.  Abstract Interpretation of Probabilistic Semantics , 2000, SAS.

[7]  Annabelle McIver,et al.  Cost analysis of games, using program logic , 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

[8]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[9]  Michael O. Rabin,et al.  The choice coordination problem , 1982, Acta Informatica.

[10]  Luca de Alfaro,et al.  Temporal Logics for the Specification of Performance and Reliability , 1997, STACS.

[11]  Dexter Kozen,et al.  Semantics of probabilistic programs , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[12]  Annabelle McIver,et al.  Probabilistic predicate transformers , 1996, TOPL.

[13]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[14]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[15]  Annabelle McIver,et al.  An Expectation-Transformer Model for Probabilistic Temporal Logic , 1999, Log. J. IGPL.

[16]  Annabelle McIver,et al.  Demonic, angelic and unbounded probabilistic choices in sequential programs , 2001, Acta Informatica.

[17]  Colin Stirling,et al.  Lokal Model Checking Games , 1995, CONCUR.

[18]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[19]  Jerzy A. Filar,et al.  Competitive Markov Decision Processes - Theory, Algorithms, and Applications , 1997 .

[20]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[21]  Moshe Y. Vardi.  A temporal fixpoint calculus , 1988, POPL '88.

[22]  Annabelle McIver,et al.  Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL , 2001, CATS.

[23]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[24]  Annabelle McIver,et al.  Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL , 2003, Theor. Comput. Sci..

[25]  Rupak Majumdar,et al.  Quantitative solution of omega-regular games , 2004, J. Comput. Syst. Sci..

[26]  Colin Stirling,et al.  Local model checking games (extended abstract) , 1995 .

[27]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[28]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[29]  Carroll Morgan,et al.  pGCL: formal reasoning for random algorithms , 1998 .

[30]  Moshe Y. Vardi.  Branching vs. Linear Time: Final Showdown , 2001, TACAS.

[31]  H. Everett.  2. RECURSIVE GAMES , 1958 .

[32]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .