Stochastic Game Logic

Authors:
Christel Baier;Tomas Brazdil;Marcus Grosser;Antonin Kucera
Affiliations:
Technische Universitat Dresden, Germany;Masaryk University, Czech Republic;Technische Universitat Dresden, Germany;Masaryk University, Czech Republic
Venue:
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Year:
2007

Citing 0
Cited 7

On the Controller Synthesis for Finite-State Markov Decision Processes

Fundamenta Informaticae
ATL with Strategy Contexts and Bounded Memory

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Strategy logic

Information and Computation
A temporal logic for the interaction of strategies

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
On the Controller Synthesis for Finite-State Markov Decision Processes

Fundamenta Informaticae
Model-Checking iterated games

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stochastic game logic (SGL) is a new temporal logic that combines features of alternating temporal logic (to formalize the individual views and cooperation and reaction facilities of agents in a multiplayer game), probabilistic computation tree logic and extended temporal logic (to reason about qualitative and quantitative, linear or branching time winning objectives). The paper presents the syntax and semantics of SGL and discusses its model checking problem. The model checking problem of SGL turns out to be undecidable when the strategies are history-dependent. We show PSPACE completeness for memoryless deterministic strategies and the EXPSPACE upper bound for memoryless randomized strategies. For the qualitative fragment of SGL we show PSPACE completeness for memoryless strategies.