On the computation of supremal sublanguages relevant to supervisory control

Thomas Moor, Christine Baier, Tae Sic Yoo, Feng Lin, Stéphane Lafortune

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Given a specification language, this paper discusses an iterative procedure for the computation of the supremal sublanguage, that possesses a conjunction of certain closed-loop properties, including controllability, normality and completeness. The iteration is stated in terms of (i) supremal sublanguage operators for each individual property, (ii) prefix-closures, and, (iii) language intersections. Within the iteration, the individual supremal sublanguage operators are only applied on prefix-closed languages, while the overall specification is not required to be prefix-closed. Our main result establishes finite convergence, provided that all parameters are regular.

Original languageEnglish
Title of host publicationWODES 2012 - 11th International Workshop on Discrete Event Systems, Proceedings
PublisherIFAC Secretariat
Pages175-180
Number of pages6
Edition29
ISBN (Print)9783902823281
DOIs
StatePublished - 2012
Event11th International Workshop on Discrete Event Systems, WODES 2012 - Guadalajara, Jalisco, Mexico
Duration: Oct 3 2012Oct 5 2012

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number29
Volume45
ISSN (Print)1474-6670

Conference

Conference11th International Workshop on Discrete Event Systems, WODES 2012
Country/TerritoryMexico
CityGuadalajara, Jalisco
Period10/3/1210/5/12

Keywords

  • Discrete event systems
  • Supervisory control
  • Supremal sublanguages

Fingerprint

Dive into the research topics of 'On the computation of supremal sublanguages relevant to supervisory control'. Together they form a unique fingerprint.

Cite this