Skip to main content

The Complexity of Some Basic Control Problems for Discrete Event Systems

  • Conference paper
Advanced Computing Concepts and Techniques in Control Engineering

Part of the book series: NATO ASI Series ((NATO ASI F,volume 47))

Abstract

We present a summary of some of the known results on the complexity of supervisory control of discrete event systems in the framework of [RW1]. In addition some recent results on the controllability of sequential behaviors and on the complexity of basic coordination problems are presented.

Research partially supported by the National Science Foundation through grant ECS-8715217 and by an IBM Faculty Development Award.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buchi, J.R., On a decision method in restricted second order arithmetic, International Congress Logic Methodology and Philosophy of Science, Stanford, Calif., 1960.

    Google Scholar 

  2. Cieslak, R., C. Desclaux, A. Fawaz, and P. Varaiya, Supervisory control of discrete event processes with partial observations, Memo no. UCB/ERL M86/63, Electronics Research Lab., College of Eng., Univ. of Calf., Berkeley, 1986.

    Google Scholar 

  3. Hopcroft, J.E., and Ullman, J.D., Introduction to Automata Theory, Languages and Computation,Addison-Wesley Pub. Co., Reading, MA., 1979.

    MATH  Google Scholar 

  4. Lin, F., and W.M. Wonham, Decentralized supervisory control of discrete-event systems, to appear: Information Sciences, 1987.

    Google Scholar 

  5. Lin, F., and W.M. Wonham, On observability of discrete-event systems, to appear: Information Sciences; see also: Systems Control Group Report #8701, Department of Elect. Eng., University of Toronto, 1987.

    Google Scholar 

  6. Pfleeger, C.P. State reduction in incompletely specified finite state machines, IEEE Transactions on Computers, C-22 (12), pp. 1099–1102, January 1979.

    MathSciNet  Google Scholar 

  7. Ramadge, P.J., Some tractable supervisory control problems for discrete event systems, ISS Technical Report, Department of Electrical Engineering, Princeton University, Princeton, N.J., October 1987.

    Google Scholar 

  8. Ramadge, P.J., and W.M. Wonham, Supervisory control of a class of discrete-event processes, SIAM J. on Contr. and Optimization,25 (1), pp. 206–230, January 1987.

    Article  MathSciNet  MATH  Google Scholar 

  9. Ramadge, P.J., and W.M. Wonham, Modular feedback logic for discrete event systems, SIAM J. on Contr. and Optimization, 25 (5), pp. 1202–1218, September 1987.

    Article  MathSciNet  Google Scholar 

  10. Ramadge, P.J., and W.M. Wonham, Modular supervisory control of discrete event systems, Proc. of the Seventh International Conference on Analysis and Optimization of Systems, Antibes, June, 1986.

    Google Scholar 

  11. Tsitsiklis, J.N., On the control of discrete event dynamical systems Technical Report LIDSP-1661, MIT, March 1987

    Google Scholar 

  12. Vaz, A., and W.M. Wonham,On supervisor reduction in discrete-event systems, Int. J. Control, 44 (2), pp. 475–491, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  13. Wonham, W.M., and P.J. Ramadge, On the supremal controllable sublanguage of a given language, SIAM J. on Contr. and Optimization, 25 (3), pp. 637–659, May 1987.

    Article  MathSciNet  Google Scholar 

  14. Wonham, W.M., and P.J. Ramadge, Modular supervisor control of discrete event systems, Mathematics of Control, Signals, and Systems, 1 (1), 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ramadge, P.J. (1988). The Complexity of Some Basic Control Problems for Discrete Event Systems. In: Denham, M.J., Laub, A.J. (eds) Advanced Computing Concepts and Techniques in Control Engineering. NATO ASI Series, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83548-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83548-3_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83550-6

  • Online ISBN: 978-3-642-83548-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics