OBLIGATION BLACKWELL GAMES AND P-AUTOMATA

DOI10.1017/jsl.2016.71zbMath1432.91019arXiv1206.5174OpenAlexW2963415977MaRDI QIDQ4977213

Nir Piterman, Krishnendu Chatterjee

Publication date: 3 August 2017

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

automatatwo-player games

Mathematics Subject Classification ID

2-person games (91A05) Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44) Algorithmic game theory and complexity (91A68)

Uses Software

• PRISM
• LiQuor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Bisimulation through probabilistic testing
• Borel determinacy
• A logic for reasoning about time and reliability
• Fair simulation
• Automata, logics, and infinite games. A guide to current research
• On the equivalence of game and denotational semantics for the probabilistic mu-calculus
• Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics
• The determinacy of Blackwell games
• The complexity of probabilistic verification
• Probabilistic propositional temporal logics
• Probabilistic modal {\mu}-calculus with independent product
• An automata-theoretic approach to branching-time model checking

This page was built for publication: OBLIGATION BLACKWELL GAMES AND P-AUTOMATA