You can always compute maximally permissive controllers under partial observation when they exist

Proceedings of the American Control Conference

Volumn 4, Issue , 2005, Pages 2287-2292

  Pinchinat, Sophie ^a   Riedweg, Stphane ^b  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

OPTIMAL SOLUTION; PERMISSIVE CONTROLLERS; SYNTHESIS ALGORITHMS;

CONTROL EQUIPMENT;

EID: 23944458658     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. P. J. Ramadge and W. Wonham, "Supervisory control of a class of discrete event processes," SIAM Journal of Control and Optimization, vol. 25, no. 1, pp. 206-230, 1987.
2. Ramadge and Wonham, "The control of discrete event systems," in Proc. of the IEEE, vol. 77(1), 1989, pp. 81-98.
3. Thistle and Wonham, "Control of of infinite behavior of finite automata," SIAM Control and Optimization, vol. 32(4), pp. 1075-1097, 1994.
4. R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya, "Supervisory control of discreteevent processes with partial observations," IEEE Transactions on Automatic Control, vol. 33, no. 3, pp. 249-260, 1988.
5. F. Lin and W. M. Wonham, "On observability of discrete-event systems," Information Sciences, vol. 44, no. 3, pp. 173-198, 1988.
6. S. Takai and T. Ushio, "Effective computation of an lm(g)-closed, - controllable, and observable sublanguage arising in supervisory control," in Workshop on Discrete Event Systems, Zaragoza. Spain, October 2002.
7. O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M. Y. Vardi, "Open systems in reactive environments: Control and synthesis," in Proc. 11th Int. Conf. on Concurrency Theory, ser. LNCS, vol. 1877. Springer-Verlag, 2000, pp. 92-107.
8. Arnold, Vincent, and Walukiewicz, "Games for synthesis of controllers with partial observation," Theoretical Computer Science, vol. 1, pp. 7-34, 2003.
9. Kozen, "Results on the prepositional μ-calculus," Theoretical Computer Science, vol. 27(3), pp. 333-354, 1983.
10. A. Arnold and D. Niwinski, Rudiments of mu-calculus. North-Holland, 2001.
11. Riedweg and Pinchinat, "Quantified mu-calculus for control synthesis," in Mathematical Foundations of Computer Science, ser. LNCS, vol. 2747, 2003, pp. 642-651.
12. E. A. Emerson and C. S. Jutla. "Tree automata, mu-calculus and determinacy," in Proceedings 32nd Annual IEEE Symp. on Foundations of Computer Science, FOCS'91, San Jose, Puerto Rico, 1-4 Oct 1991. Los Alamitos, California: IEEE Computer Society Press, 1991, pp. 368-377.
13. J. Mycielski, "Games with perfect information," in Handbook of Game Theory, R. Aumann and S. Hart, Eds. Elsevier Science Publisher, 1992, vol. 1, pp. 41-70.
14. S. Riedweg and S. Pinchinat, "Maximally permissive controllers in all contexts," in Workshop on Discrete Event Systems, Reims, France, sep 2004.