Language-measure-theoretic optimal control of probabilistic finite-state systems

I. Chattopadhyay, Asok Ray

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem.

Original languageEnglish (US)
Pages (from-to)1271-1290
Number of pages20
JournalInternational Journal of Control
Volume80
Issue number8
DOIs
StatePublished - Aug 1 2007

Fingerprint

Formal languages
Supervisory personnel
Discrete event simulation
Control theory

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

@article{a3a7b539561f4327a93aec0a1bd7be5f,
title = "Language-measure-theoretic optimal control of probabilistic finite-state systems",
abstract = "Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem.",
author = "I. Chattopadhyay and Asok Ray",
year = "2007",
month = "8",
day = "1",
doi = "10.1080/00207170701286322",
language = "English (US)",
volume = "80",
pages = "1271--1290",
journal = "International Journal of Control",
issn = "0020-7179",
publisher = "Taylor and Francis Ltd.",
number = "8",

}

Language-measure-theoretic optimal control of probabilistic finite-state systems. / Chattopadhyay, I.; Ray, Asok.

In: International Journal of Control, Vol. 80, No. 8, 01.08.2007, p. 1271-1290.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Language-measure-theoretic optimal control of probabilistic finite-state systems

AU - Chattopadhyay, I.

AU - Ray, Asok

PY - 2007/8/1

Y1 - 2007/8/1

N2 - Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem.

AB - Supervisory control theory for discrete event systems, introduced by Ramadge and Wonham, is based on a non-probabilistic formal language framework. However, models for physical processes inherently involve modelling errors and noise-corrupted observations, implying that any practical finite-state approximation would require consideration of event occurrence probabilities. Building on the concept of signed real measure of regular languages, this paper formulates a comprehensive theory for optimal control of finite-state probabilistic processes. It is shown that the resulting discrete-event supervisor is optimal in the sense of elementwise maximizing the renormalized langauge measure vector for the controlled plant behaviour and is efficiently computable. The theoretical results are validated through several examples including the simulation of an engineering problem.

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

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

U2 - 10.1080/00207170701286322

DO - 10.1080/00207170701286322

M3 - Article

AN - SCOPUS:35648929473

VL - 80

SP - 1271

EP - 1290

JO - International Journal of Control

JF - International Journal of Control

SN - 0020-7179

IS - 8

ER -