Optimal supervisory control of regular languages

Research output: Chapter in Book/Report/Conference proceedingChapter


This chapter presents optimal supervisory control of dynamical systems that can be represented by deterministic finite state automaton (DFSA) models. The performance index for the optimal policy is obtained by combining a measure of the supervised plant language with (possible) penalty on disabling of controllable events. The signed real measure quantifies the behavior of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in Chapter 1 and earlier publications. Synthesis of the optimal control policy requires at most n iterations, where n is the number of states of the DFSA model generated from the unsupervised plant language. The computational complexity of the optimal control synthesis is polynomial in n. Syntheses of the control algorithms are illustrated with two application examples.

Original languageEnglish (US)
Title of host publicationQuantitative Measure for Discrete Event Supervisory Control
PublisherSpringer New York
Number of pages31
ISBN (Print)0387021086, 9780387021089
StatePublished - 2005

All Science Journal Classification (ASJC) codes

  • General Computer Science


Dive into the research topics of 'Optimal supervisory control of regular languages'. Together they form a unique fingerprint.

Cite this