Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
This paper deals with distributed control problems by means of distributed games played on Mazurkiewicz traces. The main difference with other notions of distributed games recently introduced is that, instead of having a local view, strategies and controllers are able to use a more accurate memory, based on their causal view. Our main result states that using the causal view makes the control synthesis problem decidable for series-parallel systems for all recognizable winning conditions on finite behaviors, while this problem with local view was proved undecidable even for reachability conditions.
Unable to display preview. Download preview PDF.
- 1.Bernet, J., Janin, D., Walukiewicz, I.: Private communication (2004)Google Scholar
- 7.Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: LICS 2001, pp. 389–398. Computer Society Press, Los Alamitos (2001)Google Scholar
- 13.Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pp. 348–363. IEEE, New York (1979)Google Scholar
- 15.Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthetize. In: 31st IEEE Symp. FOCS, pp. 746–757 (1990)Google Scholar
- 17.Thomas, W.: On logical definability of traces languages. In: workshop of ESPRIT BRA 3166, ASMICS, Kochel am See (1990)Google Scholar
- 18.Zielonka, W.: Asynchronous automata. In: Rozenberg, G., Diekert, V. (eds.) Book of Traces, pp. 175–217. World Scientific, Singapore (1995)Google Scholar