Optimal supervisory control of finite state automata

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

This paper 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 behaviour of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in 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)
Pages (from-to)1083-1100
Number of pages18
JournalInternational Journal of Control
Volume77
Issue number12
DOIs
StatePublished - Aug 15 2004

Fingerprint

Finite automata
Computational complexity
Dynamical systems
Polynomials
Costs

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

@article{b585c51f5ddd43baafcd6ea863145c81,
title = "Optimal supervisory control of finite state automata",
abstract = "This paper 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 behaviour of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in 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.",
author = "Asok Ray and Jinbo Fu and Constantino Lagoa",
year = "2004",
month = "8",
day = "15",
doi = "10.1080/0020717042000273762",
language = "English (US)",
volume = "77",
pages = "1083--1100",
journal = "International Journal of Control",
issn = "0020-7179",
publisher = "Taylor and Francis Ltd.",
number = "12",

}

Optimal supervisory control of finite state automata. / Ray, Asok; Fu, Jinbo; Lagoa, Constantino.

In: International Journal of Control, Vol. 77, No. 12, 15.08.2004, p. 1083-1100.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Optimal supervisory control of finite state automata

AU - Ray, Asok

AU - Fu, Jinbo

AU - Lagoa, Constantino

PY - 2004/8/15

Y1 - 2004/8/15

N2 - This paper 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 behaviour of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in 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.

AB - This paper 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 behaviour of controlled sublanguages based on a state transition cost matrix and a characteristic vector as reported in 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.

UR - http://www.scopus.com/inward/record.url?scp=7544222948&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=7544222948&partnerID=8YFLogxK

U2 - 10.1080/0020717042000273762

DO - 10.1080/0020717042000273762

M3 - Article

AN - SCOPUS:7544222948

VL - 77

SP - 1083

EP - 1100

JO - International Journal of Control

JF - International Journal of Control

SN - 0020-7179

IS - 12

ER -