Obligation blackwell games and p-automata Journal Article


Author(s): Chatterjee, Krishnendu; Piterman, Nir
Article Title: Obligation blackwell games and p-automata
Affiliation IST Austria
Abstract: We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP∩co-NP. We also show that obligation games provide a game framework for reasoning about p-automata. © 2017 The Association for Symbolic Logic.
Keywords: Two-player games; Automata
Journal Title: Journal of Symbolic Logic
Volume: 82
Issue 2
ISSN: 00224812
Publisher: Cambridge University Press  
Date Published: 2017-06-01
Start Page: 420
End Page: 452
URL:
DOI: 10.1017/jsl.2016.71
Open access: yes (repository)
IST Austria Authors
Related IST Austria Work