Skip to main content

Part of the book series: The Springer International Series in Engineering and Computer Science ((SECS,volume 300))

  • 150 Accesses

Abstract

In this chapter, we present the supervisory control theory of discrete event systems under complete observation of events. The theory is applicable in any general setting of languages; however, for the termination of algorithms it is required that the languages be regular.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Bibliographic Remarks

  • Controllability in the context of DESs was introduced by Ramadge-Wonham [RW87b]. Refer to Ramadge-Wonham [RW89] and Thistle [Thi94] for survey articles on supervisory control of DESs. Synchronous composition [Hoa85] based supervisors were first studied by Heymann [Hey90], Smedinga [Sme87], and Kumar-Garg-Marcus [KGM91]. An algorithm to compute the supremal controllable sublanguage was first given by Ramadge-Wonham [RW87a]. A more efficient algorithm for the case when K is prefix-closed was first given by Kumar-Garg-Marcus [KGM91]. A closed-form formula for the supremal closed sublanguage was first reported in [BGK+90]. Our proof based on lattice theory is taken from [KG94b]. The blocking issues have been studied by Chen-Lafortune [CL91]. The issue of modular control was first investigated by Ramadge-Wonham [WR88]. Exercise problems 12 and 15 are taken from Ramadge-Wonham [RW89].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kumar, R., Garg, V.K. (1995). Control under Complete Observation. In: Modeling and Control of Logical Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 300. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2217-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-2217-1_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-5931-9

  • Online ISBN: 978-1-4615-2217-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics