Simpson, Alex

Stirling, Colin

Mio, Matteo

Engineering and Physical Sciences Research Council (EPSRC)

2012-08-07T14:35:33Z

2012-08-07T14:35:33Z

2012-06-25

The probabilistic (or quantitative) modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two semantics have been studied for this logic, both assigning to every process state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the other is a game semantics, specified in terms of two-player stochastic games. The two semantics have been proved to coincide on all finite PLTS’s. A first contribution of the thesis is to extend this coincidence result to arbitrary PLTS’s. A shortcoming of the probabilistic μ-calculus is the lack of expressiveness required to encode other important temporal logics for PLTS’s such as Probabilistic Computation Tree Logic (PCTL). To address this limitation, we extend the logic with a new pair of operators: independent product and coproduct, and we show that the resulting logic can encode the qualitative fragment of PCTL. Moreover, a further extension of the logic, with the operation of truncated sum and its dual, is expressive enough to encode full PCTL. A major contribution of the thesis is the definition of appropriate game semantics for these extended probabilistic μ-calculi. This relies on the definition of a new class of games, called tree games, which generalize standard 2-player stochastic games. In tree games, a play can be split into concurrent subplays which continue their evolution independently. Surprisingly, this simple device supports the encoding of the whole class of imperfect-information games known as Blackwell games. Moreover, interesting open problems in game theory, such as qualitative determinacy for 2-player stochastic parity games, can be reformulated as determinacy problems for suitable classes of tree games. Our main technical result about tree games is a proof of determinacy for 2-player stochastic metaparity games, which is the class of tree games that we use to give game semantics to the extended probabilistic μ-calculi. In order to cope with measure-theoretic technicalities, the proof is carried out in ZFC set theory extended with Martin’s Axiom at the first uncountable cardinal (MAℵ1). The final result of the thesis shows that the game semantics of the extended logics coincides with the denotational semantics, for arbitrary PLTS’s. However, in contrast to the earlier coincidence result, which is proved in ZFC, the proof of coincidence for the extended calculi is once again carried out in ZFC +MAℵ1 .

http://hdl.handle.net/1842/6223

en

The University of Edinburgh

M. Mio. A proof system for reasoning about probabilistic concurrent processes. Proof Systems for Program Logics (PSPL) 2010, a LICS 2010 affiliated workshop.

M. Mio. The equivalence of denotational and game semantics for the probabilistic μ-calculus. In Proceedings of 7th FICS Workshop, Brno, 2010.

M. Mio. Probabilistic Modal -Calculus with Independent Product. In Foundations of Software Science and Computation Structures, volume 6604 of Lecture Notes in Computer Science, pages 290–304. Springer-Verlag Berlin, 2011.

temoral logic

game semantics

Game semantics for probabilistic modal μ-calculi

Thesis or Dissertation

Doctoral

PhD Doctor of Philosophy