Games for synthesis of controllers with partial observation

Theoretical Computer Science

Volumn 303, Issue 1, 2003, Pages 7-34

  Arnold, A ^a   Vincent, A ^a   Walukiewicz, I ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Control; Discrete event systems; Games; Modal automata; Partial observation; Satisfiability

Indexed keywords

AUTOMATA THEORY; GAME THEORY; INTERFACES (COMPUTER); MODAL ANALYSIS;

LOOP TESTING;

COMPUTER SCIENCE;

EID: 0037702849     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00442-5     Document Type: Conference Paper

References (22)

1. A. Arnold, D. Niwiński, Rudiments of μ-Calculus, Studies in Logic and the Foundations of Mathematics, Vol. 146, Elsevier, Amsterdam, 2001.
2. Bergeron A. A unified approach to control problems in discrete event processes. RAIRO-ITA. 27:1993;555-573.
3. δσ J. Symbolic Logic. 48:1983;1171-1198.
4. Cassandras C.G., Lafortune S. Introduction to Discrete Event Systems. 1999;Kluwer Academic Publishers, Dordrecht.
5. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. 29th FOCS, 1988.
6. Y. Gurevich, L. Harrington, Trees, automata and games, in: Proc. 14th ACM Symp. on Theory of Computations, 1982, pp. 60-65.
7. Jiang S., Huang Z., Chandra V., Kumar R. A polynomial time algorithm for diagnosability of discrete event systems. IEEE Trans. Automat. Control. 46(8):2001.
8. Kumar R., Garg V.K. Modeling and Control of Logical Discrete Event Systems. 1995;Kluwer Academic Publishers, Dordrecht.
9. O. Kupferman, M. Vardi, Synthesis with incomplete information, in: Proc. Second Internat. Conf. on Temporal Logic, 1997, pp. 91-106.
10. O. Kupferman, M. Vardi, μ-calculus synthesis, in: Proc. MFCS 2000, Lecture Notes in Computer Science, Vol. 1893, 2000, pp. 497-507.
11. H. Lamouchi, J.G. Thistle, Effective control synthesis for DES under partial observations, in: Proc. 39th IEEE Conf. on Decision and Control, December 2000.
12. Maler O., Pnueli A., Sifakis J. On the synthesis of discrete controllers for timed systems. Mayr E.W., Puech C. Proc. STACS'95. Lecture Notes in Computer Science. Vol. 900:1995;229-242.
13. A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, in: Proc. 31th IEEE Symp. on Foundations of Computer Science (FOCS 1990), 1990, pp. 746-757.
14. Ramadge P.J.G., Wonham W.M. The control of discrete event systems. Proc. IEEE. 77:1989.
15. Rudie K., Wonham W. Think globally, act locally. IEEE Trans. Automat. Control. 37(11):1992;1692-1708.
16. Sampath M., Sengupta R., Lafortune S., Sinnamohideen K., Teneketzis D. Diagnosability of discrete event systems. IEEE Trans. Automat. Control. 40(9):1995;1555-1575.
17. Seidl H. Fast and simple nested fixpoints. Inform. Process. Lett. 59:1996;303-308.
18. Thomas W. Languages, automata, and logic. Rozenberg G., Salomaa A. Handbook of Formal Languages. Vol. 3:1997;Springer, Berlin.
19. S. Tripakis, Undecidable problems of decentralized observation and control, in: IEEE Conf. on Decision and Control, 2001.
20. A. Vincent, Synthése de contrôleurs et stratégies gagnantes dans les jeux de partité, in: MSR2001, 2001, to appear.
21. J. Vöge, M. Jurdziński, A discrete strategy improvement algorithm for solving parity games, in: Proc. CAV 2000, 2000, pp. 202-215.
22. T. Yoo, S. Lafortune, On the computational complexity of some problems arising in partially-observed discrete-event systems, in: American Control Conf. 2001, 2001.