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)

Volumn 3328, Issue , 2004, Pages 275-286

  Gastin, Paul ^a   Lerman, Benjamin ^a   Zeitoun, Marc ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER CONTROL SYSTEMS; COMPUTABILITY AND DECIDABILITY; SOFTWARE ENGINEERING;

CAUSAL MEMORY; CONTROL SYNTHESIS; DISTRIBUTED CONTROL PROBLEMS; DISTRIBUTED GAMES; FINITE BEHAVIORS; MAZURKIEWICZ TRACES; REACHABILITY; SERIES-PARALLEL SYSTEM; SYNTHESIS PROBLEMS; WINNING CONDITIONS;

COMPUTABILITY AND DECIDABILITY; DISTRIBUTED PARAMETER CONTROL SYSTEMS;

EID: 27244450613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_23     Document Type: Article

References (18)

1. J. Bernet, D. Janin, and I. Walukiewicz. Private communication. 2004.
2. J. R. Büchi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc., 138:295-311, 1969.
3. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Inform. and Comput., 106:159-202, 1993.
4. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.
5. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoret. Comput. Sci., 154(1):67-84, 1996. Conference version in ICALP '93.
6. P. Gastin, B. Lerman, and M. Zeitoun. Distributed games and distributed control for asynchronous systems. In LATIN04, volume 2976 of LNCS, pages 455-465. Springer, 2004.
7. O. Kupferman and M. Y. Vardi. Synthesizing distributed systems. In LICS '01, pages 389-398. Computer Society Press, 2001.
8. P. Madhusudan and P. S. Thiagarajan. Distributed controller synthesis for local specifications. In ICALP '01, volume 2076 of LNCS. Springer, 2001.
9. P. Madhusudan and P. S. Thiagarajan. Branching time controllers for discrete event systems. Theor. Comput. Sci., 274(1-2):117-149, 2002.
10. P. Madhusudan and P. S. Thiagarajan. A decidable class of asynchronous distributed controllers. In CONCUR '02, volume 2421 of LNCS. Springer, 2002.
11. S. Mohalik and I. Walukiewicz. Distributed games. In FSTTCS '03, volume 2914 of LNCS, pages 338-351. Springer, 2003.
12. G. Peterson, J. Reif, and S. Azhar. Lower bounds for multiplayer noncooperative games of incomplete information. Comput. Math. Appl., 41(7-8):957-992, 2001.
13. G. L. Peterson and J. H. Reif. Multiple-person alternation. In 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979), pages 348-363. IEEE, New York, 1979.
14. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In ICALP '89, volume 372 of LNCS, pages 652-671. Springer, 1989.
15. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthetize. In 31th IEEE Symp. FOCS, pages 746-757, 1990.
16. P. Ramadge and W. Wonham. The control of discrete event systems. In IEEE, volume 77, pages 81-98, 1989.
17. W. Thomas. On logical definability of traces languages. In workshop of ESPRIT BRA 3166, ASMICS, pages 172-182, Kochel am See, 1990.
18. W. Zielonka. Asynchronous automata. In G. Rozenberg and V. Diekert, editors, Book of Traces, pages 175-217. World Scientific, Singapore, 1995.