Abstract
The probabilistic modal μ-calculus pLμ (often called the quantitative μ-calculus) is a generalization of the standard modal μ-calculus designed for expressing properties of probabilistic labeled transition systems. The syntax of pLμ formulas coincides with that of the standard modal μ-calculus. Two equivalent semantics have been studied for pLμ, both assigning to each process-state p a value in [0,1] representing the probability that the property expressed by the formula will hold in p: a denotational semantics and a game semantics given by means of two player stochastic games. In this paper we extend the logic pLμ with a second conjunction called product, whose semantics interprets the two conjuncts as probabilistically independent events. This extension allows one to encode useful operators, such as the modalities with probability one and with non-zero probability. We provide two semantics for this extended logic: one denotational and one based on a new class of games which we call tree games. The main result is the equivalence of the two semantics. The proof is carried out in ZFC set theory extended with Martin’s Axiom at the first uncountable cardinal.
Chapter PDF
References
Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS 2009, IEEE Symposium on Logic in Computer Science, Los Angeles, USA (2009)
Blackwell, D.: Infinite Gδ games with imperfect information. Matematyki Applicationes Mathematicae, Hugo Steinhaus Jubilee Volume (1969)
Brázdil, T., Brozek, V., ín Kucera, A., Obdrzálek, J.: Qualitative reachability in stochastic BPA games. In: STACS, pp. 207–218 (2009)
Brázdil, T., Brozek, V., Forejt, V., Kucera, A.: Stochastic games with branching-time winning objectives. In: LICS, pp. 349–358 (2006)
de Alfaro, L., Majumdar, R.: Quantitative solution of omega-regular games. Journal of Computer and System Sciences 68, 374–397 (2004)
Deng, Y., van Glabbeek, R.: Characterising probabilistic processes logically. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 278–293. Springer, Heidelberg (2010)
Fischer, D., Gradel, E., Kaiser, L.: Model checking games for the quantitative μ-calculus. In: Theory of Computing Systems. Springer, New York (2009)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6 (1994)
Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: LICS 1997, Washington, DC, USA, p. 111. IEEE Computer Society, Los Alamitos (1997)
Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science, 333–354 (1983)
Martin, D.A., Solovay, R.M.: Internal Cohen extensions. Ann. Math. Logic 2, 143–178 (1970)
McIver, A., Morgan, C.: Results on the quantitative μ-calculus qMμ. ACM Trans. Comput. Logic 8(1), 3 (2007)
Mio, M.: The equivalence of denotational and game semantics for the probabilistic μ-calculus. In: 7th Workshop on Fixed Points in Computer Science (2010)
Morgan, C., McIver, A.: A probabilistic temporal calculus based on expectations. In: Groves, L., Reeves, S. (eds.) Proc. Formal Methods. Springer, Heidelberg (1997)
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Laboratory for Computer Science, M.I.T. (1995)
Stirling, C.: Modal and temporal logics for processes. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mio, M. (2011). Probabilistic Modal μ-Calculus with Independent Product. In: Hofmann, M. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2011. Lecture Notes in Computer Science, vol 6604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19805-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-19805-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19804-5
Online ISBN: 978-3-642-19805-2
eBook Packages: Computer ScienceComputer Science (R0)