Ben Hadj-Alouane, N., Lafortune, S., and Lin, F. 1996. Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation. J. Discrete Event Dyn. Syst.: Theory Appl.
6: 379–427.Google Scholar
Bergeron, A. 1995. Sharing out control in distributed processes. Theor. Comp. Sci.
139: 163–186.Google Scholar
Blondel, V. D., and Tsitsiklis, J. N. 2003. A survey of computational complexity results in systems and control. Automatica
36(9): 1249–1274.Google Scholar
Brandin, B. A., Malik, R., and Dietrich, P. 2000. Incremental system verification and synthesis of minimally restrictive behaviors. In Proc. of 2000 American Control Conference, pp. 4056–4061.
Burkhard, H. -D. 1997. Fairness and control in multi-agent systems. Theor. Comp. Sci.
189: 109–127.Google Scholar
Buss, S., Papadimitriou, C., and Tsitsiklis, J. 1991. On the predictability of coupled automata: An allegory about chaos. Complex Syst.
5: 525–539.Google Scholar
Cassandras, C. G., and Lafortune, S. 1999. Introduction to Discrete Event Systems.
Boston MA: Kluwer Academic Publishers.Google Scholar
Cieslak, R., Desclaux, C., Fawaz, A., and Varaiya, P. 1988. Supervisory control of discrete-event processes with partial observations. IEEE Trans. Automat. Contr.
33(3): 249–260, March.Google Scholar
Du, D. Z., Ko, K. I. 2000Theory of Computational ComplexityJohn Wiley and Sons, Inc.New YorkGoogle Scholar
Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness
. New York: W. H. Freeman.Google Scholar
Gohari, P., and Wonham, W. M. 2000. On the complexity of supervisory control design in the RW framework. IEEE Trans. Syst. Man Cybern., Part B
30(5): 643–652.Google Scholar
Harel, D., Kupferman, O., and Vardi, M. Y. 2002. On the complexity of verifying concurrent transition systems. Inf. Comput.
173: 143–161.Google Scholar
Henzinger, T. A., and Kopke, P. W. 1999. Discrete-time control for rectangular hybrid automata. Theor. Comp. Sci.
221: 369–392.Google Scholar
Hopcroft, J., and Ullman, J. 1979. Introduction to Automata Theory, Languages, and Computation
. Reading, MA, USA: Addison Wesley.Google Scholar
Jiang, S., and Kumar, R. 2000. Decentralized control of discrete event systems with specialization to local control and concurrent systems. IEEE Trans. Syst. Man Cybern., Part B
30(5): 653–660.Google Scholar
Jiang, S., Chandra, V., and Kumar R. 2001. Decentralized control of discrete event systems with multiple local specializations. In Proc. of 2001 American Control Conference, pp. 959–964.
Kozen, D. 1977. Lower bounds for natural proof systems. In Proc. 18th Symp. on the Foundations of Computer Science, pp. 254–266.
Kupferman, O., and Vardi, M. 1998. Verification of fair transition systems. Chic. J. Theor. Comput. Sci.
1998(2): 1–37.Google Scholar
Kupferman, O., and Vardi, M. 2001. Synthesizing distributed systems. In Proc. 16th IEEE Symp on Logic Computer Science, pp. 81–92.
Kupferman, O., Vardi, M., and Wolper, P. 2000. An automata-theoretic approach to branching-time model checking. J. ACM
47(2): 312–360.Google Scholar
Lange, K.-J., and Rossmanith, P. 1992. The emptiness problem for intersections of regular languages. In I. Havel (ed.), Proc. of the 17th Conf. on Mathematical Foundations of Computer Science, number 629 in LNCS, Springer-Verlag, pp. 346–354.
Leduc, R. J., Brandin, B., Lawford, M., and Wonham, W. M. 2001a. Hierarchical interface-based supervisory control: Serial case. In Proc. 40th IEEE Conf. on Decision and Control, pp. 4116–4121.
Leduc, R. J., Lawford, M., and Wonham, W. M. 2001b. Hierachical interface-based supervisory control: AIP example. In 39th Allerton Conf. on Comm., Contr., and Comp.
Lin, F., and Wonham, W. M. 1988a. Decentralized supervisory control of discrete-event systems. Inf. Sci.
44: 199–224.Google Scholar
Lin, F., and Wonham, W. M. 1988b. On observability of discrete-event systems. Inf. Sci.
44: 173–198.Google Scholar
Madhusudan, P., and Thiagarajan, P. S. 2001. Distributed controller synthesis for local specifications. In Proc. 28th Int. Colloquium Automata, Languages and Programming, pp. 396–407.
Pnueli, A., and Rosner, R. 1990. Distributed reactive systems are hard to synthesize. In Proc. 31st Symp on the Foundations of Computer Science, pp. 746–757
Queiroz, M. H., and Cury, J. E. R. 2000. Modular control of composed systems. In Proc. of 2000 American Control Conference.
Ramadge, P. J. 1989. Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata. IEEE Trans. Automat. Contr.
34(1): 10–19Google Scholar
Ramadge, P. J., and Wonham, W. M. 1987. Supervisory control of a dass of discrete-event processes. SIAM J. Control Optim.
25(1): 206–230.Google Scholar
Ramadge, P. J., and Wonhamm, W. M. 1989. The control of discrete-event systems. Proc. IEEE
77(1): 81–98.Google Scholar
Ricker, S. L., and Rudie, K. 2000. Incorporating knowledge into discrete-event control systems. IEEE Trans. Automat. Contr.
45(9): 1656–1668.Google Scholar
Rohloff, K., and Lafortune, S. 2003. On the synthesis of safe control policies in decentralized control of discrete event systems. IEEE Trans. Automat. Contr.
48(6): 1064–1068.Google Scholar
Rohloff, K., Yoo, T.-S., and Lafortune, S. 2003. Deciding co-observability is PSPACE-complete. IEEE Trans. Automat. Contr.
48(11): 1995–1999.Google Scholar
Rudie, K., and Willems, J. C. 1995. The computational complexity of decentralized discrete-event control problems. IEEE Trans. Automat. Contr.
40(7): 1313–1318.Google Scholar
Rudie, K., and Wonham, W. M. 1992. Think globally, act locally: Decentralized supervisory control. IEEE Trans. Automat. Contr.
37(11): 1692–1708, November.Google Scholar
Savitch, W. J. 1970. Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci.
4(2): 177–192.Google Scholar
Takai, S., and Ushio, T. 2000. On-line decentralized supervisory control of discrete event systems. In Proc. 39th IEEE Conf. Decis. Control, December, pp. 7–8.
Vardi, M., and Wolper, P. 1994. Reasoning about infinite computations. Inf. Comput.
115: 1–37.Google Scholar
Willner, Y., and Heyman, M. 1991. Supervisory control of concurrent discrete event systems. Int. J. Control
54(5): 1143–1169.Google Scholar
Wong, K. C., and Wonham, W. M. 1998. Modular control and coordination of discrete-event systems. J. Discret. Event Dyn. Syst.: Theory Appl.
8: 247–297.Google Scholar
Wonham, W. M., and Ramadge, P. J. 1988. Modular supervisory control of discrete event systems. Math. Control Signals Syst.
1(1): 13–30.Google Scholar
Yoo, T.-S., and Lafortune, S. 2002. A general architecture for decentralized supervisory control of discrete-event systems. J. Discret. Event Dyn. Syst.: Theory Appl.
13(3): 335–377.Google Scholar