The infimal prefix-closed and observable superlanguage of given language
暂无分享,去创建一个
[1] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Maurice Nivat,et al. Controlling Behaviours of Systems: Some Basic Concepts and some Applications , 1980, MFCS.
[4] Liz Sonenberg,et al. Fixed Point Theorems and Semantics: A Folk Tale , 1982, Inf. Process. Lett..
[5] P. Ramadge,et al. Supervision of discrete event processes , 1982, 1982 21st IEEE Conference on Decision and Control.
[6] P. Ramadge,et al. On the supermal controllable sublanguage of a given language , 1987 .
[7] C. Desclaux,et al. Supervisory control of discrete-event processes with partial observations , 1988 .
[8] Walter Murray Wonham,et al. On observability of discrete-event systems , 1988, Inf. Sci..
[9] Stéphane Lafortune,et al. The infimal closed controllable superlanguage and its application in supervisory control , 1990 .
[10] R. D. Brandt,et al. Formulas for calculating supremal controllable and normal sublanguages , 1990 .
[11] K. Inan. An algebraic approach to supervisory control , 1992, Math. Control. Signals Syst..