Language stability and stabilizability of discrete event dynamical systems

This paper studies the stability and stabilizability of discrete event dynamical systems (DEDSs) modeled by state machines. Stability and stabilizability are defined in terms of the behavior of the DEDSs, i.e. the language generated by the state machines (SMs). This generalizes earlier work where they were defined in terms of legal and illegal states rather than strings. The notion of reversal of languages is used to obtain algorithms for determining the stability and stabilizability of a given system. The notion of stability is then generalized to define the stability of infinite or sequential behavior of a DEDS modeled by a Buchi automaton. The relationship between the stability of finite and stability of infinite behavior is obtained and a test for stability of infinite behavior is obtained in terms of the test for stability of finite behavior. An algorithm of linear complexity for computing the regions of attraction is presented, which is used for determining the stability and stabilizability of a giv...

[1]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[2]  P. Ramadge,et al.  On the supremal controllable sublanguage of a given language , 1984, The 23rd IEEE Conference on Decision and Control.

[3]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[4]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[5]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[6]  M. Heymann,et al.  On stabilization of discrete-event processes , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[7]  P. Ramadge.  Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata , 1989 .

[8]  Steven I. Marcus,et al.  On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation , 1989, Math. Control. Signals Syst..

[9]  A. Willsky,et al.  Tracking and restrictability in discrete-event dynamic systems , 1990, 29th IEEE Conference on Decision and Control.

[10]  R. D. Brandt,et al.  Formulas for calculating supremal controllable and normal sublanguages , 1990 .

[11]  Panos J. Antsaklis,et al.  Stability and stabilizability of discrete event dynamic systems , 1991, JACM.

[12]  Alan S. Willsky,et al.  Output stabilizability of discrete-event dynamic systems , 1991 .

[13]  S. Marcus,et al.  On controllability and normality of discrete event dynamical systems , 1991 .

[14]  Steven I. Marcus,et al.  On ω-controllability and ω-normality of deds , 1991, 1991 American Control Conference.

[15]  Vijay K. Garg,et al.  On supervisory control of sequential behaviors , 1992 .

[16]  Ratnesh Kumar.  Supervisory synthesis techniques for discrete event dynamical systems , 1992 .

[17]  Vijay K. Garg,et al.  Control of Discrete Event Systems Modeled with Deterministic Buchi Automata , 1992, 1992 American Control Conference.

[18]  Michael Heymann,et al.  On optimal attraction in discrete-event processes , 1993, Inf. Sci..