On the equivalence of game and denotational semantics for the probabilistic mu-calculus

DOI10.2168/LMCS-8(2:7)2012zbMath1238.68082arXiv1205.0126MaRDI QIDQ2888508

Matteo Mio

Publication date: 1 June 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.0126

zbMATH Keywords

game semanticsmodal \(\mu \)-calculusprobabilistic temporal logictwo-player stochastic games

Mathematics Subject Classification ID

Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

The mu-calculus and Model Checking ⋮ Unnamed Item ⋮ Measure Properties of Game Tree Languages ⋮ Equivalence of probabilistic \(\mu\)-calculus and p-automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quasipolynomial computation of nested fixpoints ⋮ OBLIGATION BLACKWELL GAMES AND P-AUTOMATA

This page was built for publication: On the equivalence of game and denotational semantics for the probabilistic mu-calculus