A decidable class of problems for control under partial observation

Information Processing Letters

Volumn 95, Issue 4, 2005, Pages 454-460

  Pinchinat, Sophie ^a   Riedweg, Stéphane ^b  

^a CAMPUS DE BEAULIEU   (France)

^b CNRS   (France)

Author keywords

Discrete events systems; Formal methods; Optimal control; Specification language; Supervision; Temporal logic

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE DESCRIPTION LANGUAGES; CONTROL SYSTEM SYNTHESIS; FORMAL LOGIC; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DISCRETE-EVENTS SYSTEMS; FORMAL METHODS; OPTIMAL CONTROL; SUPERVISION; TEMPORAL LOGIC;

DISCRETE TIME CONTROL SYSTEMS;

EID: 21344464056     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.04.011     Document Type: Article

References (17)

1. A. Arnold, and D. Niwinski Rudiments of Mu-Calculus 2001 North-Holland Amsterdam
2. A. Arnold, A. Vincent, and I. Walukiewicz Games for synthesis of controllers with partial observation Theoret. Comput. Sci. 1 2003 7 34
3. R. Berger The undecidability of the domino problem Mem. Amer. Math. Soc. 66 1966
4. C.G. Cassandras, and S. Lafortune Introduction to Discrete Event Systems 1999 Kluwer Academic Dordrecht
5. E.A. Emerson, and J.Y. Halpern On branching versus linear time temporal logic J. ACM 33 1 1986 151 178
6. E.A. Emerson, and C.S. Jutla Tree automata, mu-calculus and determinacy Proc. IEEE FOCS'91 1991 IEEE Computer Society Press New York 368 377
7. D. Kozen Results on the propositional μ-calculus Theoret. Comput. Sci. 27 3 1983 333 354
8. O. Kupferman, P. Madhusudan, P.S. Thiagarajan, and M.Y. Vardi Open systems in reactive environments: Control and synthesis Proc. CONCUR'00 Lecture Notes in Comput. Sci. vol. 1877 2000 Springer Berlin 92 107
9. O. Kupferman, M.Y. Vardi, and P. Wolper An automata-theoretic approach to branching-time model checking J. ACM 47 2 2000 312 360
10. Y. Li, F. Lin, and Z.H. Lin A generalized framework for supervisory control of discrete event systems Internat. J. Intell. Control Systems 2 1 1998 139 159
11. F. Lin, and W.M. Wonham On observability of discrete-event systems Inform. Sci. 44 3 1988 173 198
12. D.E. Muller, and P.E. Schupp Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra Theoret. Comput. Sci. 141 1995 69 107
13. P.J. Ramadge, and W.M. Wonham The control of discrete event systems Proc. IEEE (Special issue on Dynamics of Discrete Event Systems) 77 1 1989 81 98
14. S. Riedweg, and P. Pinchinat Quantified mu-calculus for control synthesis MFCS'03 Lecture Notes in Comput Sci. vol. 2747 2003 Springer Berlin 642 651
15. S. Riedweg, S. Pinchinat, Maximally permissive controllers in all contexts, in: WODES'04, Reims, France, 2004, pp. 283-288
16. R.S. Streett, and E.A. Emerson An automata theoretic decision procedure for the propositional mu-calculus Inform. and Comput. 81 1989 249 264
17. J.G. Thistle, and W.M. Wonham Supervision of infinite behavior of discrete-event systems SIAM J. Control Optim. 32 1994 1098 1113