Distributed Games and Distributed Control for Asynchronous Systems
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-players game. This allows to transfer results from the sequential case to this distributed setting.
KeywordsDistributed game distributed control distributed strategy
Unable to display preview. Download preview PDF.
- 2.Diekert, V., Métivier, Y.: Partial Commutations and Traces. In: Handbook of Formal languages, vol. 3, pp. 457–533. Springer, Heidelberg (1997)Google Scholar
- 3.Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)Google Scholar
- 4.Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proc. of the LICS 2001. Computer Society Press (2001)Google Scholar
- 8.Pin, J., Perrin, D.: Infinite words. Automata, Semigroups, Logic and Games. Elsevier, Amsterdam (to appear)Google Scholar
- 9.Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthetize. In: Proc. of the 31st IEEE Symp. FOCS, pp. 746–757 (1990)Google Scholar
- 13.Zielonka, W.: Asynchronous automata. In: Rozenberg, G., Diekert, V. (eds.) Book of Traces, pp. 175–217. World Scientific, Singapore (1995)Google Scholar