Abstract
This paper presents the concept and formulation of a signed real measure of regular languages for analysis of discrete-event supervisory control systems. The measure is constructed based upon the principles of language theory and real analysis for quantitative evaluation and comparison of the controlled behaviour for discrete-event automata. The marked (i.e. accepted) states of finite-state automata are classified in different categories such that the event strings terminating at good and bad marked states have positive and negative measures, respectively. In this setting, a controlled language attempts to disable as many bad strings as possible and as few good strings as possible. Different supervisors may achieve this goal in different ways and generate a partially ordered set of controlled languages. The language measure creates a total ordering on the performance of the controlled languages, which provides a precise quantitative comparison of the controlled plant behaviour under different supervisors. Total variation of the language measure serves as a metric for the space of sublanguages of the regular language.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1800-1808 |
| Number of pages | 9 |
| Journal | International Journal of Control |
| Volume | 76 |
| Issue number | 18 |
| DOIs | |
| State | Published - Dec 15 2003 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Computer Science Applications
Cite this
}
Signed real measure of regular languages for discrete-event automata. / Ray, Asok; Phoha, Shashi.
In: International Journal of Control, Vol. 76, No. 18, 15.12.2003, p. 1800-1808.Research output: Contribution to journal › Article
TY - JOUR
T1 - Signed real measure of regular languages for discrete-event automata
AU - Ray, Asok
AU - Phoha, Shashi
PY - 2003/12/15
Y1 - 2003/12/15
N2 - This paper presents the concept and formulation of a signed real measure of regular languages for analysis of discrete-event supervisory control systems. The measure is constructed based upon the principles of language theory and real analysis for quantitative evaluation and comparison of the controlled behaviour for discrete-event automata. The marked (i.e. accepted) states of finite-state automata are classified in different categories such that the event strings terminating at good and bad marked states have positive and negative measures, respectively. In this setting, a controlled language attempts to disable as many bad strings as possible and as few good strings as possible. Different supervisors may achieve this goal in different ways and generate a partially ordered set of controlled languages. The language measure creates a total ordering on the performance of the controlled languages, which provides a precise quantitative comparison of the controlled plant behaviour under different supervisors. Total variation of the language measure serves as a metric for the space of sublanguages of the regular language.
AB - This paper presents the concept and formulation of a signed real measure of regular languages for analysis of discrete-event supervisory control systems. The measure is constructed based upon the principles of language theory and real analysis for quantitative evaluation and comparison of the controlled behaviour for discrete-event automata. The marked (i.e. accepted) states of finite-state automata are classified in different categories such that the event strings terminating at good and bad marked states have positive and negative measures, respectively. In this setting, a controlled language attempts to disable as many bad strings as possible and as few good strings as possible. Different supervisors may achieve this goal in different ways and generate a partially ordered set of controlled languages. The language measure creates a total ordering on the performance of the controlled languages, which provides a precise quantitative comparison of the controlled plant behaviour under different supervisors. Total variation of the language measure serves as a metric for the space of sublanguages of the regular language.
UR - http://www.scopus.com/inward/record.url?scp=0347764585&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0347764585&partnerID=8YFLogxK
U2 - 10.1080/00207170310001635392
DO - 10.1080/00207170310001635392
M3 - Article
VL - 76
SP - 1800
EP - 1808
JO - International Journal of Control
JF - International Journal of Control
SN - 0020-7179
IS - 18
ER -