Abstract
In this paper we consider a generalization of the robust supervisory control problem introduced by Lin (Lin. 1993), improved by Takai (Takai. 2000; Takai, 2002), Park and Lim (Park and Lim, 2000; Park and Lin, 2002) and Cury and Krogh (Cury and Krogh, 1999). Following the formalism in (Lin, 1993), we suppose tbe plant language L(G) ⊆ Σ belongs to a finite collection of non-empty, prefix-closed languages L(G) € {L1,L-2,.. .,Ln}, where L,(0) ⊆ Σ,1 € {1,2,...,n). The event-set Σ is partitioned into controllable (Σc) and uncontrollable (Σu) subsets respectively. We assume all events are observable, and the supervisor has no prior knowledge as to the vakie of L(G) € {Li.Z,2....,Ln}. For each Li ⊆ Σ we suppose there exists a prefix-closed language Ki ⊆ Li We present three conditions that are necessary and sufficient for the existence of a supervisor that enforces K, if the plant language L(G) - Li. It is possible that for a given choice of the sets {L1.L2 Ln} and {K1, K2, ..., Kn}, the conditions identified in this paper are not satisfied. This calls for finding a {K1, K2, -, Kn}, such that i € {1,2,_n}.Ki ⊆ K1 that meets the required conditions, and each Ki satisfies some property that we might be interested in. Tbe search for a satisfactory {K1,K2_,Kn} using the notion of monotone properties is also presented.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 355-360 |
| Number of pages | 6 |
| Journal | IFAC Proceedings Volumes (IFAC-PapersOnline) |
| Volume | 37 |
| Issue number | 11 |
| DOIs | |
| State | Published - Jan 1 2004 |
| Event | 10th IFAC/IFORS/IMACS/IFIP Symposium on Large Scale Systems: Theory and Applications, LSS 2004 - Osaka, Japan Duration: Jul 26 2004 → Jul 28 2004 |
Fingerprint
Keywords
- Discrete event systems
- Inductive learning
ASJC Scopus subject areas
- Control and Systems Engineering
Cite this
On a generalization of robust supervisory control of discrete event systems. / Sreenivas, Ramavarapu S.
In: IFAC Proceedings Volumes (IFAC-PapersOnline), Vol. 37, No. 11, 01.01.2004, p. 355-360.Research output: Contribution to journal › Conference article
}
TY - JOUR
T1 - On a generalization of robust supervisory control of discrete event systems
AU - Sreenivas, Ramavarapu S
PY - 2004/1/1
Y1 - 2004/1/1
N2 - In this paper we consider a generalization of the robust supervisory control problem introduced by Lin (Lin. 1993), improved by Takai (Takai. 2000; Takai, 2002), Park and Lim (Park and Lim, 2000; Park and Lin, 2002) and Cury and Krogh (Cury and Krogh, 1999). Following the formalism in (Lin, 1993), we suppose tbe plant language L(G) ⊆ Σ belongs to a finite collection of non-empty, prefix-closed languages L(G) € {L1,L-2,.. .,Ln}, where L,(0) ⊆ Σ,1 € {1,2,...,n). The event-set Σ is partitioned into controllable (Σc) and uncontrollable (Σu) subsets respectively. We assume all events are observable, and the supervisor has no prior knowledge as to the vakie of L(G) € {Li.Z,2....,Ln}. For each Li ⊆ Σ we suppose there exists a prefix-closed language Ki ⊆ Li We present three conditions that are necessary and sufficient for the existence of a supervisor that enforces K, if the plant language L(G) - Li. It is possible that for a given choice of the sets {L1.L2 Ln} and {K1, K2, ..., Kn}, the conditions identified in this paper are not satisfied. This calls for finding a {K1, K2, -, Kn}, such that i € {1,2,_n}.Ki ⊆ K1 that meets the required conditions, and each Ki satisfies some property that we might be interested in. Tbe search for a satisfactory {K1,K2_,Kn} using the notion of monotone properties is also presented.
AB - In this paper we consider a generalization of the robust supervisory control problem introduced by Lin (Lin. 1993), improved by Takai (Takai. 2000; Takai, 2002), Park and Lim (Park and Lim, 2000; Park and Lin, 2002) and Cury and Krogh (Cury and Krogh, 1999). Following the formalism in (Lin, 1993), we suppose tbe plant language L(G) ⊆ Σ belongs to a finite collection of non-empty, prefix-closed languages L(G) € {L1,L-2,.. .,Ln}, where L,(0) ⊆ Σ,1 € {1,2,...,n). The event-set Σ is partitioned into controllable (Σc) and uncontrollable (Σu) subsets respectively. We assume all events are observable, and the supervisor has no prior knowledge as to the vakie of L(G) € {Li.Z,2....,Ln}. For each Li ⊆ Σ we suppose there exists a prefix-closed language Ki ⊆ Li We present three conditions that are necessary and sufficient for the existence of a supervisor that enforces K, if the plant language L(G) - Li. It is possible that for a given choice of the sets {L1.L2 Ln} and {K1, K2, ..., Kn}, the conditions identified in this paper are not satisfied. This calls for finding a {K1, K2, -, Kn}, such that i € {1,2,_n}.Ki ⊆ K1 that meets the required conditions, and each Ki satisfies some property that we might be interested in. Tbe search for a satisfactory {K1,K2_,Kn} using the notion of monotone properties is also presented.
KW - Discrete event systems
KW - Inductive learning
UR - http://www.scopus.com/inward/record.url?scp=85064453939&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85064453939&partnerID=8YFLogxK
U2 - 10.1016/S1474-6670(17)31636-1
DO - 10.1016/S1474-6670(17)31636-1
M3 - Conference article
AN - SCOPUS:85064453939
VL - 37
SP - 355
EP - 360
JO - IFAC-PapersOnLine
JF - IFAC-PapersOnLine
SN - 2405-8963
IS - 11
ER -