Supervisory Control with Complete Observations

Aus International Center for Computational Logic
Version vom 5. Februar 2015, 12:49 Uhr von Tomas Masopust (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tomáš |ErsterAutorNachname=Masopust |FurtherAuthors=Jan H. van Schuppen; }} {{Incollection |Title=Supervisory…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Supervisory Control with Complete Observations

Tomáš MasopustTomáš Masopust,  Jan H. van SchuppenJan H. van Schuppen
Supervisory Control with Complete Observations


  • ISBN: 978-1-4471-4275-1
  • ISSN: 0170-8643
  • DOI Link
Tomáš Masopust, Jan H. van Schuppen
Supervisory Control with Complete Observations
In Seatzu, C., Silva, M., van Schuppen, J.H., eds., Control of Discrete-event Systems, volume 433 of Lecture Notes in Control and Information Sciences, 45-64. Springer, 2013
  • KurzfassungAbstract
    Supervisory control is control of a behavior or, equivalently, of a discrete-event system in this chapter modeled as an automaton. Supervisory control is exerted by specifying after each observation the set of enabled events. The automaton then chooses an event from the subset of enabled events, makes a transition and produces the observed event, after which the process repeats. The logical control objectives of supervisory control are legal behavior and required behavior. Legal behavior is a formal language which specifies what the automaton is safely allowed to do. The required behavior is a formal language which specifies what the system is required to do such as the completion of tasks. The main theorem is then that there exists a supervisory control such that the formal language of the controlled automaton equals the specification if and only if the specification is a controllable sublanguage. An algorithm to determine whether a specification is controllable is provided as well as an algorithm to compute the supervisor. If the specification is not controllable then there exists a supremal controllable sublanguage of the specification and a corresponding supervisory control.
  • Forschungsgruppe:Research Group: Knowledge SystemsKnowledge-Based Systems
The final publication is available at Springer via http://dx.doi.org/10.1007/978-1-4471-4276-8_3.
@incollection{MS2013,
  author    = {Tom{\'{a}}{\v{s}} Masopust and Jan H. van Schuppen},
  title     = {Supervisory Control with Complete Observations},
  editor    = {Seatzu and C. and Silva and M. and van Schuppen and {J.H.}},
  booktitle = {Control of Discrete-event Systems},
  series    = {Lecture Notes in Control and Information Sciences},
  volume    = {433},
  publisher = {Springer},
  year      = {2013},
  pages     = {45-64},
  doi       = {10.1007/978-1-4471-4276-8_3}
}