Abstract
This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control within a unified framework. The language measure provides total ordering of any set of partially ordered sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are discussed for computation of the language measure. A physical interpretation of the language measure is given from the perspective of discreteevent supervisory control synthesis.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the IEEE Conference on Decision and Control |
| Pages | 3233-3238 |
| Number of pages | 6 |
| DOIs | |
| State | Published - Dec 1 2003 |
| Event | 42nd IEEE Conference on Decision and Control - Maui, HI, United States Duration: Dec 9 2003 → Dec 12 2003 |
Publication series
| Name | Proceedings of the IEEE Conference on Decision and Control |
|---|---|
| Volume | 4 |
| ISSN (Print) | 0191-2216 |
Other
| Other | 42nd IEEE Conference on Decision and Control |
|---|---|
| Country | United States |
| City | Maui, HI |
| Period | 12/9/03 → 12/12/03 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization
Cite this
}
Signed Real Measure of Regular Languages. / Surana, Amit; Ray, Asok.
Proceedings of the IEEE Conference on Decision and Control. 2003. p. 3233-3238 (Proceedings of the IEEE Conference on Decision and Control; Vol. 4).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Signed Real Measure of Regular Languages
AU - Surana, Amit
AU - Ray, Asok
PY - 2003/12/1
Y1 - 2003/12/1
N2 - This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control within a unified framework. The language measure provides total ordering of any set of partially ordered sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are discussed for computation of the language measure. A physical interpretation of the language measure is given from the perspective of discreteevent supervisory control synthesis.
AB - This paper reviews and extends the recent work on signed real measure of regular languages for discrete-event supervisory control within a unified framework. The language measure provides total ordering of any set of partially ordered sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata under different supervisors. The paper presents a procedure by which performance of different supervisors can be evaluated based on a common quantitative tool. Two algorithms are discussed for computation of the language measure. A physical interpretation of the language measure is given from the perspective of discreteevent supervisory control synthesis.
UR - http://www.scopus.com/inward/record.url?scp=1542349963&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1542349963&partnerID=8YFLogxK
U2 - 10.1109/CDC.2003.1271641
DO - 10.1109/CDC.2003.1271641
M3 - Conference contribution
AN - SCOPUS:1542349963
SN - 0780379241
T3 - Proceedings of the IEEE Conference on Decision and Control
SP - 3233
EP - 3238
BT - Proceedings of the IEEE Conference on Decision and Control
ER -