Supervisor existence for modular discrete-event systems

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 36, Issue 18, 2003, Pages 205-210

  Rohloff, Kurt R ^a   Lafortune, Stephane ^a  

^a University of Michigan   (United States)

Author keywords

Computational Complexity; Discrete Event Systems; Modular and Concurrent Systems; Regular Languages; Specification and Verification; Supervision and Control

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; FORMAL LANGUAGES; SPECIFICATIONS; SUPERVISORY PERSONNEL;

CONCURRENT SYSTEMS; CONTROL ACTIONS; DECISION PROBLEMS; EXISTENCE CONDITIONS; MODULAR SYSTEM; PARALLEL COMPOSITION; PSPACE-COMPLETE; SPECIFICATION AND VERIFICATION;

DISCRETE EVENT SIMULATION;

EID: 1542282396     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/S1474-6670(17)34669-4     Document Type: Conference Paper

References (19)

1. C.G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Kluwer Academic Publishers. Boston. ~lA. 1999.
2. R Cieslak. C. Desclaux. A. Fawaz., P. Varaiya. Supervisory control of discrete-event processes with partial observations. IEEE Trans. Auto. Contr., 33(3):249-260, ~larch 1988.
3. P. Gohari and Vl.~L Wonham. On the complexity of supervisory control design in the RW framework. IEEE Transactions on Systems. Man and Cybernetics. Part B, 30(5):643-652, 2000.
4. D. Harel, O. Kupferman., M.Y. Vardi. On the complexity of verifying concurrent transition systems. Information and Computation, 173: 143-161, 2002. 210
5. S. Jiang and R Kumar. Decentralized control of discrete event systems with specializations to local control and concurrent systems. IEEE Transactions on Systems, Man and Cybernetics. Part B, 30(5):653-660, 2000.
6. D. Kozen. Lower bounds for natural proof systems. In Proc. 18th Symp. on the Foundations of Computer Science, pages 254-266, 1977.
7. O. Kupferman and M. Vardi. Synthesizing distributed systems. In Proc. 16th IEEE Symp. on Logic in Computer Science, pages 81-92, 2001.
8. O. Kupferman, M. Vardi, P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2): 312-360, 2000.
9. RJ. Leduc, B. Brandin, M. Lawford, W.M. Wonham. Hierarchical interface-based supervisory control: Serial case. In Proc. 40th IEEE Conf. on Decision and Control, pages 41164121, 2001.
10. F. Lin and W. M. Wonham. Decentralized supervisory control of discrete-event systems. Information Sciences, 44:199-224, 1988a.
11. F. Lin and W. M. Wonham. On observability of discrete-event systems. Information Sciences, 44:173-198,1988b.
12. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In Proc. 31st Symp. on the Foundations of Computer Science, pages 746-757, 1990.
13. M. H. Queiroz and J. E. R Cury. Modular control of composed systems. In Proc. of 2000 American Control Conference, 2000.
14. P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete-event processes. SIAM Journal of Control Optimization, 25(1): 206-230, 1987.
15. P.J. Ramadge and W.M. Wonham. The control of discrete-event systems. Proc. IEEE, 77(1): 81-98, 1989.
16. K. Rohloff and S. Lafortune. On the computational complexity of the verification of modular discrete-event systems. In Proc. 41st IEEE Conf. on Decision and Control. Las Vegas. l\evada. December 2002.
17. K. Rudie and W.M. Wonham. Think globally. act locally: Decentralized supervisory control. IEEE Trans. Auto. Contr. 37(11):1692-1708.
18. Ovember 1992. l. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation. 115:1-37. 1994.
19. T.-S. Yoo and S. Lafortune. A general architecture for decentralized supervisory control of discreteevent systems. Journal of Discrete Event Dynamical Systems: Theory and Applications, 13 (3):335-377, 2002.