论文信息 - On self-stabilizing systems: an approach to the specification and design of fault tolerant systems

On self-stabilizing systems: an approach to the specification and design of fault tolerant systems

A self-stabilizing system is one which can recover from transient faults in a finite number of steps. The authors present a theory for determining if a behavior specification can be satisfied with a self-stabilizing system. If not, then what the largest self-stabilizing subset and smallest self-stabilizing superset of the specification is. The effects of self-stabilizing behavior on the control of discrete event systems is also investigated.<<ETX>>

Vijay K. Garg | S. D. Young

[1] W. M. Wonham,et al. The control of discrete event systems , 1989 .

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

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

[4] Edsger W. Dijkstra,et al. Self-stabilizing systems in spite of distributed control , 1974, CACM.

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

[6] Mohamed G. Gouda,et al. Token Systems that Self-Stabilize , 1989, IEEE Trans. Computers.

[7] M. Heymann,et al. Stabilization of discrete-event processes , 1990 .

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

[9] W. Parry. Intrinsic Markov chains , 1964 .

[10] Steven I. Marcus,et al. Stability of Discrete Event System Behavior , 1991 .

[11] B. Weiss. Subshifts of finite type and sofic systems , 1973 .

[12] Chi-Tsong Chen,et al. Introduction to linear system theory , 1970 .

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

[14] Edsger W. Dijkstra,et al. Predicate Calculus and Program Semantics , 1989, Texts and Monographs in Computer Science.

[15] Roland Fischer. Sofic systems and graphs , 1975 .