skip to main content
article
Free Access

Stability and stabilizability of discrete event dynamic systems

Published:01 July 1991Publication History
First page image

References

  1. 1 BEN-Am, M. Principles of Concurrent Programming. Prentice-Hall, Englewood Chffs, N.J., 1982. Google ScholarGoogle Scholar
  2. 2 BOCHMANN, G.V. Distributed System Design. Springer-Verlag, New York, 1983. Google ScholarGoogle Scholar
  3. 3 CIESLAK, R., DESCLAUX, C., FAWAZ, A., AND VARAIYA, P. Supervisory control of discrete-event processes with partial observations. IEEE Trans. Automatic Contr. 53, 3 (Mar. 1988), 249-26O.Google ScholarGoogle Scholar
  4. 4 CLARKE, E. M., AND GRUMBERG, O. Research on automatic verification of finite-state concurrent systems. Tech Rep. CMU-CS-87-105. Carnegie-Mellon Univ., Pittsburgh, Pa., Jan. 1987.Google ScholarGoogle Scholar
  5. 5 DIJKSTRA, E.W. Solution of a problem in concurrent programming control. Commun. A CM 5, 9 (Sept. 1965), 569-570. Google ScholarGoogle Scholar
  6. 6 DIJKSTRA, E.W. Self-stabilizing systems in spite of distributed control. Commun. A CM 17, 11 (Nov. 1974), 643-644. Google ScholarGoogle Scholar
  7. 7 FRANK, G. A., FRANKE, D. L., AND INGOGLY, W. F. An architecture design and assessment system. VLSI Design (Aug. 1985).Google ScholarGoogle Scholar
  8. 8 GEVARTER, W.B. Expert systems: Limited but powerful. IEEE Spectrum (Aug. 1983).Google ScholarGoogle Scholar
  9. 9 GOLAZEWSKI, C. H., AND RAMADGE. P.J. Mutual exclusion problems for discrete event systems with shared events. In Proceedings of the Conference on Decision and Control (Houston, Tex., Dec.). IEEE, New York, 1988.Google ScholarGoogle Scholar
  10. 10 LIN, F., AND WONHAM, W. M. Decentralized supervisory control of discrete event systems. Systems Control Group Report 8612. Univ. Toronto, Toronto, Ont., Canada, July 1986.Google ScholarGoogle Scholar
  11. 11 MAIMON, O. Z., AND TADMOR, G. Efficient supervisors in discrete event systems. In Proceedings of 1986 International Conference of Systems, Man, and Cybernetics. 1986.Google ScholarGoogle Scholar
  12. 12 MERCHANT, M.E. Production: A dynamic challenge. IEEE Spectrum (May 1983).Google ScholarGoogle Scholar
  13. 13 OSTROFF, J. S., AND WONHAM, W. M. A temporal logic approach to real time control. In Proceedings of Conference on Decision and Control (Ft. Lauderdale, Fla., Dec.). IEEE, New York, 1985.Google ScholarGoogle Scholar
  14. 14 OZVEREN, C. M. Analysis and control of discrete event dynamic systems: A state space approach. Laboratory for Information and Decision Systems Report, LIDS-TH-1907. PhD dissertation. MIT, Cambridge, Mass. Aug. 1989.Google ScholarGoogle Scholar
  15. 15 (~ZVEREN, C. M., AND WILLSKY, A. S. Aggregation and multi-level control in discrete event dynamic systems. Automatica, submitted for publication. Google ScholarGoogle Scholar
  16. 16 OZVEREN, C. M., AND WILLSKY, A. S. Tracking and restrictability in discrete event dynamic systems. SIAM J. Cont. Optimization, submitted for publication. Google ScholarGoogle Scholar
  17. 17 OZVEREN, C. M., AND WILLSKY, A.S. Observability of discrete event dynamic systems. IEEE Trans. Automatic Cont., (May 1990).Google ScholarGoogle Scholar
  18. 18 RAMADGE, P. J. AND WONHAM, W. M. Modular feedback logic for discrete event systems. SIAM J. Cont. Optimization, 25, 5 (Sept. 1987), 1202-1217. Google ScholarGoogle Scholar
  19. 19 RAMADGE, P. J., AND WONHaM, W. M. Supervisory control of a class of discrete event processes. SIAM J. Cont. Optimization 25, 1 (Jan. 1987), 206-207. Google ScholarGoogle Scholar
  20. 20 SIFAKIS, J. Deadlocks and livelocks in transition systems. Tech. Rep. 185., Jan. 1980.Google ScholarGoogle Scholar
  21. 21 TADMOR, G., AND MAIMON, O. Z. Control of large discrete event systems: Constructive algorithms. LIDS Publication LIDS-P-1627. MIT, Cambridge, Mass., Dec. 1986Google ScholarGoogle Scholar
  22. 22 THOMAS, W. Automata on infinite objects. In Lehrstuhl fi~r Inforrnatik H. RWTH Aachen, D-5100 Aachen, Apr. 1988.Google ScholarGoogle Scholar
  23. 23 TOBIAS, L., AND SCOGGINS, J. L. Time-based air-traffic management using expert systems. IEEE Control Syst. Mag. (Apr. 1987).Google ScholarGoogle Scholar
  24. 24 VAZ, A. F., AND WONHAM, W.M. On supervisor reduction in discrete event systems. Int J Cont. 44, 2 (1986), 475-491.Google ScholarGoogle Scholar
  25. 25 WONHAM, W. M. Linear multivariable control: A geometric approach. Springer-Verlag, New York, 1985.Google ScholarGoogle Scholar
  26. 26 WONHAM, W. M., AND RAMADGE, P.J. Oil the supremal controllable sublanguage of a given language. SIAM J. Cont. Optimization 25, 3 (May 1987), 637-659. Google ScholarGoogle Scholar

Index Terms

  1. Stability and stabilizability of discrete event dynamic systems

          Recommendations

          Reviews

          Magnus Steinby

          The authors formulate the discrete versions of some central notions of systems and control theory and discuss them in terms of automata theory. Discrete event structures are modeled as nondeterministic finite automata, and concepts like stability, invariance, and fairness are then defined accordingly. For example, stability means that during any infinite computation the automaton will infinitely often be in one of the good states in which the system recovers from possible errors. Several facts and basic algorithms related to these notions are presented. One of the main topics is the stabilization of a system. The definitions tend to be rather complicated and sometimes even unclear. For example, the functions d and f in the definition of a system are redundant, since all information they carry is included in the definition of a nondeterministic automaton. Only finite paths are introduced, although in the definition of the stability concepts one should use infinite paths. The control input function u is described in two nonequivalent ways. Such problems could have been avoided by a more extensive use of the theory of finite automata, and it seems obvious that further work in this area would benefit in many ways from closer ties with classical automata theory. (Somewhat surprisingly, the authors make no relevant references to the literature on automata .) Nevertheless, the approach proposed by the authors appears natural and promising. The paper is interesting in spite of its formal faults.

          Access critical reviews of Computing literature here

          Become a reviewer for Computing Reviews.

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader