Distributed games with causal memory are decidable for series-parallel systems

Paul Gastin (1) , Benjamin Lerman (1) , Marc Zeitoun (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We introduce distributed games over asynchronous transition systems to model a distributed controller synthesis problem. A game involves two teams and is not turn-based: several players of both teams may simultaneously be enabled. We define distributed strategies based on the causal view that players have of the system. We reduce the problem of finding a winning distributed strategy with a given memory to finding a memoryless winning distributed strategy in a larger distributed game. We reduce the latter problem to finding a strategy in a classical 2-player game. This allows to transfer results from the sequential case to this distributed setting.

Domaines: Informatique et théorie des jeux [cs.GT]; Autre [cs.OH]

Paul Gastin, Benjamin Lerman, Marc Zeitoun. Distributed games with causal memory are decidable for series-parallel systems. Proc. of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS04, 2004, Chennai, India. pp.275-286, ⟨10.1007/b104325⟩. ⟨hal-00306315⟩