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. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Gastin, P., Lerman, B., & Zeitoun, M. (2004). Distributed games with causal memory are decidable for series-parallel systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3328, 275–286. https://doi.org/10.1007/978-3-540-30538-5_23
Mendeley helps you to discover research relevant for your work.