The Control of Discrete Event Systems

Proceedings of the IEEE

Volumn 77, Issue 1, 1989, Pages 81-98

  Ramadge, Peter J C ^a   Murray Wonham, W ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEMS--THEORY;

COMPUTATIONAL COMPLEXITY; DISCRETE EVENT DYNAMIC SYSTEMS; MODULARITY;

MATHEMATICAL MODELS;

EID: 0024479313     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.21072     Document Type: Article

References (83)

1. S. Aggarwal, C. Coucoubetis, and P. Wolper, “Adding liveness properties to coupled finite state machines,” preprint, AT&T Bell Laboratories, Murray Hill, NJ, 1988.
2. R. Akella and P. R. Kumar, “Optimal control of production rate in a failure prone manufacturing system,” IEEE Trans. Automat. Contr., vol. 31, no. 2, pp. 116–126, Feb. 1986.
3. J. Beauquier and M. Nivat, “Application of formal language theory to problems of security and synchronization,” in Formal Language Theory—Perspective and Open Problems, R. V. Book, Ed. New York: Academic Press, 1980, pp. 407–454.
4. C. Berthet and E. Cerny, “An algebraic model for asynchronous circuits verification,” IEEE Trans. Comput., vol. 37, no. 7, pp. 835–847, July 1988.
5. T. Bielecki and P. R. Kumar, “Optimality ot zero inventory policies for unrealiable manufacturing systems,” preprint, Dept. Electrical Engineering, University of Illinois, Urbana, IL, 1986.
6. A. D. Bovopoulos and A. A. Lazar, “Optimal routing and flow control of a network of parallel processors,” preprint, Dept. Electrical Engineering, Columbia University, NY, Jan. 1985.
7. J. A. Buzacott, “Optimal operating rules for automated manufacturing systems,” IEEE Trans. Automat. Contr., vol. 27, no. 2, pp. 80–86, Feb. 1982.
8. H. Choand S. J. Marcus, “On the supremal languages of sublanguages that arise in supervisor synthesis problems with partial observation,” Mathematics Contr., Signals Syst., vol. 2, no. 2, pp. 47–69, 1989.
9. R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya, “Supervisory control of discrete event processes with partial observations,” IEEE Trans. Automat. Contr., vol. 33, no. 3, pp. 249–260, Mar. 1988.
10. G. Cohen, D. Dubois, J. P. Quadrat, and M. Voit, “A linear system-theoretic view of discrete event processes and its use for the performance evaluation in manufacturing,” IEEE Trans. Automat. Contr., vol. 30, no. 3, pp. 210–220, 1985.
11. C. A. Courcoubetis and R. R. Weber, “A bin packing system for objects with sizes from finite set: necessary and sufficient conditions for stability and some applications,” in Proc. 25th Conf. Decision and Control, (Athens, Greece), pp. 1686–1691, Dec. 1986.
12. E. W. Dijkstra, “Self-stabilizing systems in spiteof distributed control,” Commun. ACM, vol. 17, no. 11, pp. 643–644, Nov. 1974.
13. M. J. Fisher, “The consensus problem in unreliable distributed systems (a brief survey),” Research Rep. YALEU/DCS/RR-273, Dept. Computer Science, Yale University, June 1983.
14. M. J. Fisher, N. A. Lynch, and M. S. Patterson, “Impossibility of distributed consensus with one faulty process,” J. ACM, vol. 32, no. 2, pp. 374–382, Apr. 1982.
15. G. S. Fishman, Principles of Discrete Event Simulation. New York, NY: Wiley, 1978.
16. J. Gertner and R. Kurshan, “Logical analysis of digital circuits,” preprint, AT&T Bell Laboratories, Murray Hill, NJ, 1987.
17. C. H. Golaszewski and P. J. Ramadge, “Mutual exclusion problems for discrete event systems with shared events,” in Proc. 27th IEEE Conf. Decision and Control (Austin, TX), pp. 234–239, Dec. 1988.
18. “Discrete event processes with arbitrary controls,” in Advanced Computing Concepts and Techniques in Control Engineering, M. J. Denham and A. J. Laub, Eds., Springer-Verlag NATO ASI Series. New York, NY: Springer Verlag, 1988, pp. 459–469.
19. B. Hajek, “Optimal control of two interacting service stations,” IEEE Trans. Automat. Contr., vol. 29, no. 6, pp. 491–499, June 1984.
20. Y. C. Ho and C. Cassandras, “A new approach to the analysis of discrete event dynamic systems,” Automatica, vol. 19, no. 2, pp. 149–167, 1983.
21. C. A. R. Hoare, Communicating Sequential Processes. Englewood Cliffs, NJ: Prentice-Hall, 1985.
22. J. E. Hoperoft and J. D. Uiiman, Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley, 1979.
23. K. Inan and P. Varaiya, “Finitely recursive process models for discrete event systems,” IEEE Trans. Automat. Contr., vol. 33, no. 7, pp. 626–639, July 1988.
24. R. Kurshan, “Reducibility in analysis of coordination,” in Discrete Event Systems: Models and Applications, IIASA Conference, Sopron, Hungary, Aug. 3-7, 1987
25. P. Varaiya and A. B. Kurzhanski, Eds., Lecture Notes in Control and Information Sciences, vol. 103. New York, NY: Springer-Verlag, 1988, pp. 19–39.
26. R. P. Kurshan, “Testing containment of u-regular languages,” preprint, AT&T Bell Laboratories, Murray Hill, NJ, Oct. 1986.
27. S. Lafortune, “Modelling and analysis of transaction execution in database systems,” IEEE Trans. Automat. Contr., vol. 33, no. 5, pp. 439–447, May 1988.
28. S. Lafortune and E.Wong, “A state model for the concurrency control problem in data base management systems,” Memo. UCB/ERL M85/27, Electronic Systems Laboratory, College of Engineering, University of California Berkeley, CA, Apr. 1985.
29. A. A. Lazar and M. T. Hsiao, “Network and user optimal flow control with decentralized information,” preprint, Dept. Electrical Engineering, Columbia University, NY.
30. E. A. Lee, “Data flow programming for parallel implementation of digital signal processing systems,” in Discrete Event Systems: Models and Applications, IIASA Conference, Sopron, Hungary, Aug. 3-7, 1987
31. P. Varaiya and A. B. Kurzhanski, Eds., Lecture Notes in Control and Information Sciences, vol. 103. New York, NY: Springer-Verlag, 1988, pp. 135–148.
32. Y. Li and W. M. Wonham, “On supervisory control of realtime discreteevent systems,” Inform. ScJ., vol. 46, pp. 159–183, 1988.
33. “Controllability and observability in the state-feedback control of discreteevent systems,” in Proc. 27th IEEE Conf. Decision and Control (Austin, TX), pp. 203–208, Dec. 1988.
34. “A state-variable approach to the modelling and control of discreteevent systems,” in Proc. 26th Annual Allerton Conf., Sept. 1988.
35. “Deadlock issues in supervisory control of discreteevent systems,” in Proc. 22nd Annual Conf. Information Sciences and Systems, (Princeton, NJ), pp. 57–63, Mar. 1988.
36. W. Lin and P. R. Kumar, “Optimal control of a queueing system with two heterogeneous servers,” IEEE Trans. Automat. Contr., vol. 29, pp. 696–703, Aug. 1984.
37. F. Lin and W. M. Wonham, “Decentralized control and coordination of discreteevent systems,” in Proc. 27th IEEE Conf. Decision and Control (Austin, TX), pp. 1125–1130, Dec. 1988.
38. “On observability of discreteevent systems,” Inform. ScJ., vol. 44, pp. 173–198, 1988.
39. “Decentralized supervisory control of discreteevent systems,” Inform. ScJ., vol. 44, pp. 199–224, 1988.
40. O. Maimon and G. Tadmore, “Efficient low level control of FMS,” Draft Tech. Rep. L1DS-P-1571, Laboratory for Information and Decision Systems, MIT, Cambridge, MA, June 1986.
41. Z. Manna and A. Pnueli, “Synthesis of communicating processes from temporal logic specifications,” ACM Trans. Programming Languages and Syst., vol. 6, no. 1, pp. 68–93, Jan. 1984.
42. G. Milne and R. Mil ner, “Concurrent processes and their syntax,” J. ACM, vol. 26, pp. 302–321, 1979.
43. K. Okumura, “Protocol analysis from language structure,” preprint, IBM Research, Tokyo Research Laboratory, 5-19, Tokyo, June 1988.
44. J. S. Ostroff and W. M. Wonham, “A temporal logic approach to real time control,” in Proc. 24th IEEE Conf. Decision and Control, (Fort Lauderdale, Florida), pp. 656–657, Dec. 1985.
45. J. S. Ostroff, “Real time computer control of discrete event systems modelled by extended state machines: A temporal logic approach,” Rep. 8618, Dept. Electrical Engineering, University of Toronto, Sept. 1986.
46. C. H. Papadimitriou and J. N. Tsitsiklis, “On the complexity of designing distributed protocols,” Inform. Contr., vol. 53, pp. 211–218, June 1982.
47. “On the complexity of Markov decision processes,” Mathematics Operations Res., vol. 12, no. 3, pp. 441–450, Aug. 1987.
48. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
49. C. P. Pfleeger, “State reduction in incompletely specified finite state machines,” IEEE Trans. Comput., vol. C-22, no. 12, pp. 1099–1102, Jan. 1979.
50. A. Pneuli, “The temporal semantics of concurrent programs,” in Semantics of Concurrent Computation, Lecture Notes in Computer Science 70. New York, NY: Springer-Verlag, 1979, pp. 1–20.
51. P.J. Ramadge, “Some tractable supervisory control problems for discrete event systems described by Biichi automata,” IEEE Trans. Automat. Contr., vol. 34, no. 1, Jan. 1989.
52. “The complexity of some basic problems in the supervisory control of discrete event systems,” in Advanced Computing Concepts and Techniques in Control Engineering, M. J. Denham and A. J. Laub, Eds., Springer-Verlag NATO ASI Series. New York, NY: Springer Verlag, 1988, pp. 171–190.
53. “Supervisory control of discrete event systems: a survey and some new results,” in Discrete Event Systems: Models and Applications, IIASA Conference, Sopron, Hungary, Aug. 3-7, 1987
54. P. Varaiyaand A. B. KurzhanskiLecture Notes in Control and Information Sciences, vol. 103. New York, NY: Springer-Verlag, 1988, pp. 69–80.
55. “Some tractable supervisory control problems for discrete event systems,” to appear in Proc. Symp. on the Mathematical Theory of networks and Systems, (Phoenix, AZ), June 1987.
56. “Observability of discrete event systems,” in Proc. 25th IEEE Conf. Decision and Control, (Athens, Greece), pp. 1108–1112, Dec. 10-12, 1986.
57. “A note on the fixpoint characterization of supremal controllable sublanguages,” in Proc. 21st Conf. Information Sciences and Syst., pp. 741–744, Mar. 1987.
58. P. J. Ramadge and W. M. Wonham, “Modular feedback logic for discrete event systems,” SIAMJ. Contr. Optimization, vol. 25, no. 5, pp. 1202–1218, May 1987.
59. “Supervisory control of a class of discreteevent processes,” SIAMJ. Contr. Optimization, vol. 25, no. 1, pp. 206–230, Jan. 1987.
60. “Modular supervisory control of discrete event systems,” in Proc. 7th Int. Conf. Analysis and Optimization of Syst., (Antibes, France), pp. 202–214, June 1986.
61. D. Raychaudhuri “Aloha with multiplacket messages and ARQ-type retransmission protocols—throughput analysis,” IEEE Trans. Commun., vol. 32, no. 2, pp. 148–154, Feb. 1984.
62. “Stability and optimal retransmission control of announced retransmission random access systems,” preprint, RCA Laboratories, Princeton, NJ, 1985.
63. Z. Rosberg, P. P. Varaiya, and J. C. Walrand, “Optimal control of service in tandem queues,” IEEE Trans. Automat. Contr., vol. 27, no. 3, pp. 600–610, June 1982.
64. K. Sabnani, “An algorithmic technique for protocol verification,” IEEE Trans. Commun., vol. 36, no. 3, pp. 924–931, Aug. 1988.
65. A. C. Shaw, “Software descriptions with flow expressions,” IEEE Trans. Software Eng., vol. 4, no. 3, pp. 242–254, 1978.
66. R. Smedinga, “Using trace theory to model discrete events,” in Discrete Event Systems: Models and Applications, IIASA Conference, Sopron, Hungary, Aug. 3-7, 1987
67. P. Varaiya and A. B. Kurzhanski, Eds., Lecture Notes in Control and Information Sciences, vol. 103. New York, NY: Springer-Verlag, 1988, pp. 81–99.
68. M. Steenstrup, M. A. Arbib, and E. G. Manes, “Port automata and the algebra of concurrent processes,” Computer and Information Science Tech. Rep. 81-25, University of Massachusetts, Amherst, MA, 1981.
69. R. Suri and M. Zazanis, “Perturbation analysis is exact for the M/G/1 queue,” in Proc. 23rd IEEE Conf. Decision and Control, (Las Vegas, NV), pp. 535–536, Dec. 1984.
70. S. Toueg and K. Steiglitz, “Deadlock free packet switching networks,” SIAMJ. Computing, vol. 10, pp. 594–611, Aug. 1981.
71. J. G. Thistle and W. M. Wonham, “Control problems in a temporal logic framework,” Int. J. Contr., vol. 44, no. 4, pp. 943–976, 1986.
72. “Supervisory control with infinite string specifications,” in Proc. 25th Ann. Allerton Conf. Communications, Control, and Computing, pp. 327–334, Sept. 1987.
73. “On the synthesis of supervisors subject to u-language specifications,” in 22nd Ann. Conf. Information Sciences and Systems, (Princeton, NJ), pp. 440–444, Mar. 1988.
74. J. N. Tsitsiklis, “On the control of discrete event dynamical systems,” Math. Contr., Signals, and Syst., vol. 2, no. 1, pp. 95–107, 1989.
75. P. P. Varaiya, J. C. Walrand, and C. Buyukkoc, “Extensions of the multiarmed bandit problem: the discounted case,” IEEE Trans. Automat. Contr., vol. 30, no. 5, pp. 426–439, May 1985.
76. A. Vaz and W. M. Wonham, “On supervisor reduction in discreteevent systems,” Int.J. Contr., vol. 44, no. 2, pp. 475–491, 1986.
77. J. Walrand, An Introduction To Queueing Networks. Englewood Cliffs, NJ: Prentice-Hall, 1988.
78. W. M. Wonham, “A control theory for discreteevent systems,” in Advanced Computing Concepts and Techniques in Control Engineering, M.J. Denham and A. J. Laub, Eds., Springer-Verlag NATO ASI Series. New York, NY: Springer Verlag, 1988, pp. 129–169.
79. W. M. Wonham and P.J. Ramadge, “Modular supervisor control of discrete event systems,” Math. Contr., Signals, and Syst., vol. 1, no. 1, pp. 13–30, Jan. 1988.
80. “On the supremal controllable sublanguage of a given language,” SIAM J. Contr. and Optimization, vol. 25, no. 3, pp. 637–659, May 1987.
81. M. A. Zazanis and R. Suri, “Estimating second derivatives of performance measures for G/G/1 queues from a single sample path,” preprint, Division of Applied Sciences, Harvard University, Cambridge, MA, June 1985.
82. B. P. Zeigler, Multifaceted Modeling and Discrete Event Simulation. New York, NY: Academic Press, 1984.
83. H. Zhong and W. M. Wonham, “On hierarchical control of discrete event systems,” in 22nd Ann. Conf. on Information Sciences and Syst., (Princeton, NJ), pp. 64–70, Mar. 1988.