Deciding Co-observability is PSPACE-Complete

IEEE Transactions on Automatic Control

Volumn 48, Issue 11, 2003, Pages 1995-1999

  Rohloff, Kurt ^a   Yoo, Tae Sic ^a   Lafortune, Stéphane ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Co observability; Computational complexity; Discrete event systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISCRETE TIME CONTROL SYSTEMS; OBSERVABILITY; POLYNOMIALS;

CO-OBSERVABILITY; DISCRETE EVENT SYSTEMS;

AUTOMATA THEORY;

EID: 0345258447     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2003.819285     Document Type: Article

References (17)

1. C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Norwell, MA: Kluwer, 1999.
2. R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya, "Supervisory control of discrete-event processes with partial observations," IEEE Trans. Automat. Contr., vol. 33, pp. 249-260, Mar. 1988.
3. D. Z. Du and K. I. Ko, Theory of Computational Complexity. New York: Wiley, 2000.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
5. P. Gohari and W. M. Wonham, "On the complexity of supervisory control design in the RW framework," IEEE Trans. Syst., Man, Cybern. B, vol. 30, pp. 643-652, Oct. 2000.
6. J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation. Reading: Addison-Wesley, 1979.
7. D. Kozen, "Lower bounds for natural proof systems," in Proc. 18th Symp. Foundations Computer Science, 1977, pp. 254-266.
8. K.-J Lange and P. Rossmanith, "The emptiness problem for intersections of regular languages," in Proc. 17th Conf. Mathematical Foundations of Computer Science, Number 629 in LNCS, I. Havel, Ed., 1992, pp. 346-354.
9. F. Lin and W. M. Wonham, "On observability of discrete-event systems," Inform. Sci., vol. 44, pp. 173-198, 1988.
10. K. Rohloff and S. Lafortune, "On the synthesis of safe control policies in decentralized control of discrete event systems," IEEE Trans. Automat. Contr., vol. 48, pp. 1064-1068, June 2003.
11. _ "On the computational complexity of the verification of modular discrete-event systems," in Proc. 41st IEEE Conf. Decision Control, Las Vegas, NV, Dec. 2002, pp. 10-13.
12. K. Rudie and J. C. Willems, "The computational complexity of decentralized discrete-event control problems," IEEE Trans. Automat. Contr., vol. 40, pp. 1313-1318, July 1995.
13. K. Rudie and W. M. Wonham, "Think globally, act locally: Decentralized supervisory control," IEEE Trans. Automat. Contr., vol. 37, pp. 1692-1708, Nov. 1992.
14. W. J. savitch, "Relationships between nondeterministic and deterministic tape complexities," J. Comput. Syst. Sci, vol. 4, no. 2, pp. 177-192, 1970.
15. S. Tripakis, "Undecidable problems of decentralized observation and control," in Proc. 40th IEEE Conf. Decision Control, 2001, pp. 4104-4109.
16. J. Tsitsiklis, "On the control of discrete-event dynamical systems," Math. Control, Signals Syst., vol. 2, pp. 95-107, 1989.
17. T.-S. Yoo and S. Lafortune, "A general architecture for decentralized supervisory control of discrete-event systems," J. Discrete Event Dyna. Syst.: Theory Applicat., vol. 13, no. 3, pp. 335-377, 2002.