Decentralized Control of Discrete Event Systems with Multiple Local Specializations 1
|
|
- Baldric Hardy
- 6 years ago
- Views:
Transcription
1 Decentralized Control of Discrete Event Systems with Multiple Local Specializations Shengbing Jiang, Vigyan Chandra, Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY {sjian0, vigyan, Abstract The decentralized supervisory control problem of discrete event systems with local specifications is studied in this paper. A necessary and sufficient condition is obtained for the existence of modular supervisors for ensuring that a group of local specifications is achieved by the controlled system. For illustration an example of a simple manufacturing system is given. This paper provides a modular approach for the design of supervisors for large systems. Keywords: Discrete event system, supervisory control, controllability, observability, decentralized control. Introduction The supervisory control theory for discrete event systems was first proposed by Ramadge and Wonham. In [7], they introduced the notion of controllability as a necessary and sufficient condition for the existence of a supervisor that achieves a desired controlled behavior for a given discrete event system under the complete observation of events. When the events are not completely observed by the supervisor but are filtered by an observation mask, an additional condition of observability introduced by Lin and Wonham [4], and Cieslak et al. [] is needed for the existence of the supervisor. In the more general case of decentralized control when there are more than one supervisors, the uncontrollable event set for the ith supervisor is Σ ui, and its observation is filtered through the mask M i, the condition of co-observability is required in place of observability, as shown in Cieslak et al. [] for the case when the controlled behavior is given as a prefix-closed language, which was later generalized to the non-prefixclosed case by Rudie and Wonham [8]. This research was supported by the National Science Foundation under the Grant NSF-ECS In [5], Lin and Wonham considered a specialized version of the decentralized control, where the mask M i is a projection type mask, and the local controllable event set Σ ci is a subset of local observable event set Σ i := M i (Σ). The authors gave a sufficient condition in terms of the normality that guarantees that the decentralized control can achieve the optimal behavior achievable by a centralized supervisor. Later in [6], they extended their results to the systems with partial observation. They gave a sufficient condition for the existence of decentralized supervisors that ensure that the controlled behavior of the system lies in a given range expressed by conjunction of local specifications. In [9], Willner and Heymann also studied the problem of [5], except that the systems they considered were concurrent systems. They introduced the notion of separability and proved that under certain conditions the separability is a necessary and sufficient condition that guarantees that the decentralized control can achieve the optimal behavior achievable by a centralized supervisor. In [], we studied a version of decentralized control problem that is more general than those reported above, and provided a necessary and sufficient condition for the existence of decentralized supervisors for keeping the controlled behavior of the system in a given range. Results of [5, 6, 9] can be derived as special cases of our result. All the above work on decentralized control has to do with a global specification which may be specified through local specifications, i.e., given K L(G), find local supervisors {S i } such that L(( i S i)/g) = K. If K is given through local specifications {K i }, then K = i T i (K i ). Even if the global specification is given as a conjunction of local specifications, the satisfaction of global specification does not imply the satisfying of each local specification, i.e., [L(( i S i)/g) = ( i T i (K i )) L(G)] [T j [L(( i S i)/g)] = K j, j]
2 where K i T i (L(G)) is the local specification, and T i is the natural projection from the global event set to the local event set. But in practice, we may encounter the case that each local specification must be satisfied. In this paper we study this problem. We first examine the general decentralized control problem studied in [] and shown in Figure. Instead of con- σ M ( σ) T G S Σ disable G..... set union..... T n Gn n Σ disable S n Figure : Diagram of the system σ n M n( σ n) sidering a global specification which is the case in [], we consider a group of local specifications. We obtain a necessary and sufficient condition for the existence of decentralized supervisors ensuring that each local specification is satisfied. Next we consider a special case of the above problem, namely, the decentralized control of concurrent systems with partial observations where G = i G i, which implies L(G) = i T i [L(G i )]. A necessary and sufficient condition is also derived for the existence of decentralized supervisors in this special case. Finally, an illustrative example based on a simple manufacturing system is provided. Notation and Preliminaries This paper is set in the supervisory control framework for discrete-event systems developed by Ramadge and Wonham [7]. For the readers convenience, some background results from the cited references are first provided in this section. For a detailed introduction of the theory, readers may refer to [3]. An uncontrolled discrete event system is modeled as an automaton G = (Q, Σ, δ, q 0, Q m ), where Q is a set of states, Σ is a set of event labels, q 0 Q is the initial state, Q m Q is the set of marked states, and δ : Σ Q Q, the transition function, is a partial function defined at each state in Q for a subset of Σ. Let Σ denote the set of all finite strings over Σ including the null string ɛ. Then δ : Σ Q Q can be extended in the obvious way to δ : Σ Q Q. The language generated by G is given by, L(G) := {s Σ δ(s, q 0 ) is defined}, and the language marked by G is given by, L m (G) := {s Σ δ(s, q 0 ) Q m }. In general, a language over Σ is any subset of Σ. The prefix-closure pr(k) of a language K Σ is the set of all prefixes of strings in K. K is called prefix-closed if pr(k) = K. To study control of a system, its event set Σ is partitioned into two subsets Σ c and Σ u of controllable and uncontrollable events respectively. A supervisor S is a pair (R, ψ) where R is an automaton which recognizes a language over the same event set as G, and ψ is the feedback map from the event set and the states of R to the set {enable, disable}. If X denotes the set of states of R, then ψ satisfies: ψ(σ, ) =enable if σ Σ u. R is considered to be driven by the strings generated by G, and in turn, at each state x of R, the control rule ψ(σ, x) dictates the occurrence of σ at the corresponding state of G. The behavior of the supervised system is represented by an automaton S/G. The language generated by the supervised system is denoted by L(S/G), and its marked language is L m (S/G) := L(S/G) L m (G). A supervisor S = ((X, Σ, ξ, x 0 ), ψ) is complete for G if for every string s in Σ and every event σ in Σ, the conditions s L(S/G), sσ L(G), and ψ(σ, ξ(s, x 0 )) =enable together imply that sσ L(S/G). It will always be assumed that S is complete. Given a nonempty prefix-closed sublanguage K of L(G), there exists a supervisor S such that L(S/G) = K if and only if K is (L(G), Σ u )-controllable [7], i.e., pr(k)σ u L(G) pr(k). If K is not controllable, then a supervisor is synthesized for achieving the supremal prefixed closed and controllable sublanguage of K, denoted by supp C(K). When the supervisor can not observe all the events, the concept of observation mask is introduced. An observation mask is a function M : Σ {ɛ}, where ɛ, and is called the set of observed events. The mask function can be extended to the set of strings in a natural way. A supervisor S for G is said to be mask-compatible [3] if it observes only M(L(G)). In this paper, it is assumed that all supervisors for partially observed systems must be mask-compatible supervisors. A sublanguage K of L(G) is said to be (L(G), M)- observable [4] if the conditions s, s pr(k), M(s) = M(s ), sσ pr(k), and s σ L(G) together imply
3 s σ pr(k). If K is not observable, then the infimal prefix closed and observable superlanguage of K denoted inf P O(K) exists [4]. Given a nonempty prefixclosed sublanguage K of L(G) and an observation mask M, there exists a supervisor S such that L(S/G) = K if and only if K is (L(G), Σ u )-controllable and (L(G), M)- observable [4]. Let A, E Σ be two languages with A E L m (G), M be an observation mask, then there exists a supervisor S such that A L(S/G) E if and only if infp CO(A) E, where infp CO(A) is the infimal prefix-closed, controllable, and observable superlanguage of A [4]. 3 Decentralized Control In this section we study the decentralized supervisory control problem of discrete event systems with local specifications for ensuring the satisfaction of a group of local specifications. We consider the general setting of decentralized control problem studied in []. Let G be a plant, Σ be the global event set, Σ i Σ, i I, be the local event sets. Let T i : Σ Σ i {ɛ} denote the natural projection from the global event set to the local event set. We use G i to denote the automaton with L(G i ) = T i [L(G)], i I, called the local system; here L(G i ) represents the ith local behavior of the system G. Let Σ ci Σ i be the ith local controllable event set, then the global controllable event set is given by Σ c := i Σ ci, the local uncontrollable event set is given by Σ ui := Σ Σ ci, the global uncontrollable event set is given by Σ u := Σ Σ c = Σ i (Σ Σ ui ) = i Σ ui. Finally, let M i : Σ i i {ɛ} be the local observation mask. If S i is a local supervisor for G i, then we can extend S i to a global supervisor S i for G, by letting S i not observe all events in Σ Σ i, and permanently enable all events in Σ Σ ci. Then it is easy to see that L( S i /G) = L(G) T i [L(S i /G i )], i I. From [, Theorem ], we have the following result for global specification under the general decentralized control of Figure. Theorem Let G be a plant, Σ be the global event set, Σ i Σ, i I, be the local event sets. Let T i be the natural projection from Σ to Σ i, Σ ci Σ i be the local controllable event set, M i be the local observation mask. Given a nonempty prefix-closed sublanguage K of L(G), there exists a group of local supervisors {S i, i I} such that L(( i S i )/G) = K if and only if K = L(G) ( i T i [infp CO i (T i (K))]), where S i is the extension of S i to the global system G, and infp CO i (T i (K)) is the infimal prefix closed, (L(G i ), Σ ui )-controllable and (L(G i ), M i )- observable superlanguage of T i (K) (Σ ui := Σ Σ ci ; and L(G i ) := T i [L(G)] is the ith local behavior of the system). Consider the following target specification problem: Given a group of nonempty prefix-closed languages {K i L(G i ), i I}, find local supervisors {S i, i I} such that T j [L(( S i i )/G)] = K j, j I, i.e., T j [L(G) ( i T i [L(S i /G i )])] = K j. For the existence of the local supervisors, a necessary and sufficient condition is obtained in the following theorem. Theorem Let G be a plant, Σ be the global event set, Σ i Σ, i I, be the local event sets. Let T i be the natural projection from Σ to Σ i, Σ ci Σ i be the local controllable event set, M i be the local observation mask. Given a group of nonempty prefixclosed languages {K i L(G i ), i I}, there exists a group of local supervisors {S i, i I} such that T j [L(( S i i )/G)] = K j for all j I if and only if j I, K j = T j [L(G) ( i T i (infp CO i (K i )))], where S i is the extension of S i to the global system G, and infp CO i (T i (K)) is the infimal prefix closed, (L(G i ), Σ ui )-controllable and (L(G i ), M i )- observable superlanguage of T i (K) (Σ ui := Σ Σ ci ; and L(G i ) := T i [L(G)] is the ith local behavior of the system). Proof: The sufficiency is obvious, since we can choose the local supervisor S i by letting L(S i /G i ) = infp CO i (K i ). Then the result follows from the definition of L(( i S i )/G) and the hypothesis. To prove the necessity, if the local supervisors exist, we let K = L(( S i i )/G), i.e., K = L(G) ( i T i [L(S i /G i )]). Then from hypothesis we have T i (K) = K i for all i I. Since K is a global specification, and it can be achieved by the local supervisors {S i, i I}, from Theorem we know K = L(G) ( i T i [infp CO i (T i (K))]). Further from T i (K) = K i we have: j I, K j = T j (K) = T j [L(G) ( i T i (infp CO i (K i )))]. This completes the proof.
4 Remark Theorem 3 provides a modular approach for the design of supervisors of large systems. For the large systems having many subsystems, and each subsystem having its own local specification, we first check whether these local specifications satisfy the condition in Theorem 3. If the local specifications do satisfy the condition, then we can design the local supervisors S i by letting L(S i /G i ) = infp CO i (K i ). Having solved the target specification problem, we next consider the following range specification problem: Given two groups of languages {A i L(G i ), i I} and {E i L(G i ), i I} with A i E i for all i I, find local supervisors {S i, i I} such that j I, A j T j [L(( S i i )/G)] E j. This problem should be viewed as a generalization of the target specification problem studied above, since when A i = E i = K i for all i, it reduces to the target specification problem. The following theorem provides a necessary condition and a separate sufficient condition for the range specification problem. Theorem 3 Let G be a plant, Σ be the global event set, Σ i Σ, i I, be the local event sets. Let T i be the natural projection from Σ to Σ i, Σ ci Σ i be the local controllable event set, M i be the local observation mask. Given two groups of languages {A i L(G i ), i I} and {E i L(G i ), i I} with A i E i for all i I, there exists a group of local supervisors {S i, i I} such that j I, A j T j [L(( i S i )/G)] E j if j I, A j T j [L(G) ( i T i (infp CO i (A i )))] E j, where infp CO i T i (A) is the infimal prefix-closed, (L(G i ), Σ ui )-controllable, and (L(G i ), M i )-observable superlanguage of T i (A). Also the condition j I, T j [L(G) ( i T i (infp CO i (A i )))] E j, is necessary for the existence of the local supervisors. Proof: The sufficiency of the first condition is obvious, since we can choose the local supervisor S i such that L(S i /G i ) = infp CO i (A i ) for each ith local system G i. For the necessity of the second condition, if the local supervisors exist, then we let K = L(( S i i )/G), i.e., K = L(G) ( i T i [L(S i /G i )]). Then we have A i T i (K) E i. Since L(S i /G i ) is prefix-closed, (L(G i ), Σ ui )-controllable, and (L(G i ), M i )-observable, which together with the fact that A i T i (K) T i [ j T j (L(S j /G j ))] L(S i /G i ) gives infp CO i (A i ) L(S i /G i ) for all i. So the following holds for all j I, T j [L(G) ( i T i (infp CO i (A i )))] T j [L(G) ( i T i (L(S i /G i )))] = T j (K) E j. This completes the proof. So far we have not assumed any structural properties of the system considered. Now we suppose that the system G is composed of concurrent subsystems, G i, with event sets Σ i, i.e., G := i G i, and Σ = i Σ i. From [9, Proposition 3.], we have L(G) = i T i [L(G i )]. (Note that in the earlier analysis of Section 3 we also had the local systems {G i } with L(G i ) = T i L(G), but we only have the property that L(G) i T i [L(G i )].) We also note that for the concurrent system the property L(G i ) T i L(G) holds instead of the definition L(G i ) := T i L(G) used for non-concurrent systems. It can be seen that a concurrent system is a special case of the systems we considered up to now. So we can derive the results for the concurrent system as before, by applying L(G) = i T i [L(G i )]. We give the similar results to those of Theorem and 3, omitting the proofs. Theorem 4 Let G be a concurrent system with G = i G i, i I, Σ be the global event set, which is the union of local event sets, i.e., Σ = i Σ i, i I. Let T i be the natural projection from Σ to Σ i, Σ ci Σ i be the local controllable event set, M i be the local observation mask. Then for a given group of nonempty prefix-closed languages {K i L(G i ), i I}, there exists a group of local supervisors {S i, i I} such that T j [L(( i S i )/G)] = K j for all j I if and only if j I, K j = T j [ i T i (infp CO i (K i ))], where infp CO i T i (K) is the infimal prefix closed, (L(G i ), Σ ui )-controllable, and (L(G i ), M i )-observable superlanguage of T i (K), and Σ ui := Σ i Σ ci is the local uncontrollable event set. Theorem 5 Let G be a concurrent system with G = i G i, i I, Σ be the global event set, which is the union of local event sets, i.e., Σ = i Σ i, i I. Let T i be the natural projection from Σ to Σ i, Σ ci be the local controllable event set, M i be the local observation mask.
5 Given two groups of languages {A i L(G i ), i I} and {E i L(G i ), i I} with A i E i for all i I, there exist local supervisors {S i, i I} such that j I, A j T j [L(( i S i )/G)] E j if j I, A j T j [ i T i (infp CO i (A i ))] E j. where G, G, and G 3 represent C, T, and W respectively, and are shown in Figure 3. Here we consider only closed languages, therefore all states are considered to be marked states. Also the condition j I, T j [ i T i (infp CO i (A i ))] E j, (a) (b) τ (c) is necessary for the existence of the local supervisors. Remark As stated in Remark, we only need the local information L(G i ) when designing the local supervisor S i, since S i achieves the language infp CO i (K i ). However to verify the condition in Theorem, we still need the global information L(G). Only local information suffices for the concurrent systems as is obvious from the condition of Theorem 4. So for the concurrent systems, we need not compute L(G). This provides tremendous computational savings for large concurrent systems. 4 Illustrative example In this section, we apply our results to a simple manufacturing system. The system, shown in Figure, consists of a transporter T, a part conveyor C, and a workstation W, which includes a buffer with a capacity of. angle sensor rack Transporter Gearbox motor TRANSPORTER pinion Unloading position Workstation FIXTURE Part Conveyor Conveyor Gearbox motor Processed part loading position Figure : A manufacturing system Workpieces are taken from the input port of the system and transfered to the buffer of W by the conveyor C; then they are processed on workstation W ; after the processing, they are taken away from W to the output port by the transporter T. We assume that there are an infinite number of workpieces at the input port of the system, and a workpiece is taken away from the output port immediately. The system is modeled as G = G G G 3, Figure 3: Subsystems G, G, and G 3 The event labels in Figure 3 represent the following actions: : a workpiece is taken from the input port by C; : a workpiece is taken from W by T ; : a workpiece is sent to the buffer of W by C; : a workpiece is sent to the output port by T τ : a workpiece is processed on W. The event τ is the only uncontrollable event. At first, we consider the case that all events are observable. The global event set is Σ = {,,,, τ }, and the local event sets are Σ = {, }, Σ = {, }, and Σ 3 = {, τ, }. We have Σ c = Σ, Σ c = Σ, Σ 3c = {, }, T i : Σ Σ i, M i = Id, for i =,, 3. Figure 4: Automaton for A 3 τ τ τ Figure 5: Automaton for E 3 The local range specifications are given as {A, A, A 3, E, E, E 3 }, where E = A = L(G ), E = A = L(G ). A 3 is generated by the automaton in Figure 4, requiring that the system can run continuously. E 3 is generated by the automaton in Figure 5, requiring that the overflow and the underflow of W be avoided.
6 It is easy to check that Using the fact we can verify that infp CO 3 (A 3 ) = A 3 E 3. infp CO i (A i ) = A i = E i, i =,, j, T j [ i T i (infp CO i (A i ))] = A j. So from Theorem 5 we know that there exist local supervisors {S i, i =,, 3} such that j, A j T j [ i T i (L(S i /G i ))] E j. In fact, {S i, i =,, 3} can be synthesized as follows: S and S enable all events at all states; S 3 = (R 3, ψ 3 ), R 3 is the automaton in Figure 6, ψ 3 disables at states {x 0, x } and at state x 4. τ τ x x x 0 Figure 6: Automaton for R 3 x x 3 4 Now suppose that, owing to a failure in a sensor, event becomes unobservable in G 3, i.e., M 3 ( ) = ɛ. Then we can calculate infp CO 3 (A 3 ), which is the language generated by the automaton in Figure 7. τ τ Figure 7: Automaton for infp CO 3 (A 3 ) From Figure 5 and Figure 7, it can be seen that infp CO 3 (A 3 ) E 3, since ( τ ) 3 infp CO 3 (A 3 ) and ( τ ) 3 E 3. Also we can verify that T 3 [ i T i (infp CO i (A i ))] = infp CO 3 (A 3 ). So T 3 [ i T i (infp CO i (A i ))] E 3. So the necessary condition in Theorem 5 does not hold, which implies that no local supervisors exist for this case. specifications for ensuring the satisfaction of a group of local specifications. The main result is the derivation of a necessary and sufficient condition for the existence of decentralized supervisors. This result was also specialized to the setting of decentralized control of concurrent systems. The ideas were illustrated by application to a simple manufacturing system. References [] R. Cieslak, C. Desclaux, A. Fawaz, and P. Varaiya. Supervisory control of discrete event processes with partial observation. IEEE Transactions on Automatic Control, 33(3):49 60, 988. [] S. Jiang and R. Kumar. Decentralized Control of Discrete Event Systems with Specializations to Local Control and Concurrent Systems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 30(5), Oct [3] R. Kumar and V. K. Garg. Modeling and Control of Logical Discrete Event Systems. Kluwer Academic Publishers, Boston, MA, 995. [4] F. Lin and W. M. Wonham. On observability of discrete-event systems. Information Sci., 44(3):73-98, 988. [5] F. Lin and W. M. Wonham. Decentralized supervisory control of discrete-event systems. Information Sci., 44(3):99-4, 988. [6] F. Lin and W. M. Wonham. Decentralized control and coordination of discrete-event systems with partial observation. IEEE Transactions on Automatic Control, 35(): , 990. [7] P. J. Ramadge and W. M. Wonham. Supervisory control of a class of discrete event processes. SIAM Journal of Control and Optimization, 5():06 30, 987. [8] K. Rudie and W. M. Wonham. Think globally, act locally: decentralized supervisory control. IEEE Transactions on Automatic Control, 37():69-708, 99. [9] Y. Willner and M. Heymann. Supervisory control of concurrent discrete-event systems. Int. J. Control, 54(5):43-69, Conclusions In this paper we studied the decentralized supervisory control problem of discrete event systems with local
Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control 1
Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Email: kumar@engr.uky.edu
More informationOn Supervisory Control of Concurrent Discrete-Event Systems
On Supervisory Control of Concurrent Discrete-Event Systems Yosef Willner Michael Heymann March 27, 2002 Abstract When a discrete-event system P consists of several subsystems P 1,..., P n that operate
More informationOn the Design of Adaptive Supervisors for Discrete Event Systems
On the Design of Adaptive Supervisors for Discrete Event Systems Vigyan CHANDRA Department of Technology, Eastern Kentucky University Richmond, KY 40475, USA and Siddhartha BHATTACHARYYA Division of Computer
More informationMasked Prioritized Synchronization for Interaction and Control of Discrete Event Systems
Masked Prioritized Synchronization for Interaction and Control of Discrete Event Systems Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Michael Heymann
More informationA Polynomial Algorithm for Testing Diagnosability of Discrete Event Systems
A Polynomial Algorithm for Testing Diagnosability of Discrete Event Systems Shengbing Jiang, Zhongdong Huang, Vigyan Chandra, and Ratnesh Kumar Department of Electrical Engineering University of Kentucky
More informationFORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M.
FORMULAS FOR CALCULATING SUPREMAL CONTROLLABLE AND NORMAL SUBLANGUAGES 1 R. D. Brandt 2,V.Garg 3,R.Kumar 3,F.Lin 2,S.I.Marcus 3, and W. M. Wonham 4 2 Department of ECE, Wayne State University, Detroit,
More informationOn Controllability and Normality of Discrete Event. Dynamical Systems. Ratnesh Kumar Vijay Garg Steven I. Marcus
On Controllability and Normality of Discrete Event Dynamical Systems Ratnesh Kumar Vijay Garg Steven I. Marcus Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin,
More informationOptimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency
Optimal Non-blocking Decentralized Supervisory Control Using G-Control Consistency Vahid Saeidi a, Ali A. Afzalian *b, Davood Gharavian c * Phone +982173932626, Fax +982177310425 a,b,c Department of Electrical
More informationSynthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems
53rd IEEE Conference on Decision and Control December 5-7, 24. Los Angeles, California, USA Synthesis of Maximally Permissive Non-blocking Supervisors for Partially Observed Discrete Event Systems Xiang
More informationExtension based Limited Lookahead Supervision of Discrete Event Systems
Extension based Limited Lookahead Supervision of Discrete Event Systems Ratnesh Kumar, Hok M. Cheung Department of Electrical Engineering University of Kentucky, Lexington, KY 40506 Steven I. Marcus Department
More informationA Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems
A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems Jin Dai, Ali Karimoddini and Hai Lin Abstract A fault-tolerant controller is a controller that drives the plant to satisfy
More informationSupervisory control under partial observation is an important problem
2576 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 62, NO. 5, MAY 2017 Technical Notes and Correspondence Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach Xiang
More informationLanguage Stability and Stabilizability of Discrete Event Dynamical Systems 1
Language Stability and Stabilizability of Discrete Event Dynamical Systems 1 Ratnesh Kumar Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Vijay Garg Department of
More informationDecentralized Modular Control of Concurrent Fuzzy Discrete Event Systems
2010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010 ThB07.2 Decentralized Modular Control of Concurrent Fuzzy Discrete Event Systems Awantha Jayasiri, George
More informationDiagnosis of Dense-Time Systems using Digital-Clocks
Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code 480-106-390 Warren, MI 48090-9055 Email: shengbing.jiang@gm.com Ratnesh Kumar Dept. of Elec. & Comp. Eng.
More informationReducing the Supervisory Control of Discrete- Event Systems under Partial Observation
MODARES JOURNAL OF ELECTRICAL ENGINEERING, VOL 16, NO 4, WINTER 2016 29 Reducing the Supervisory Control of Discrete- Event Systems under Partial Observation Vahid Saeidi, Ali A. Afzalian, and Davood Gharavian
More informationDECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES. Wenbin Qiu and Ratnesh Kumar
DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES Wenbin Qiu and Ratnesh Kumar Department of Electrical and Computer Engineering Iowa State University Ames, IA 50011, U.S.A.
More informationMOST OF the published research on control of discreteevent
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 1, JANUARY 1998 3 Discrete-Event Control of Nondeterministic Systems Michael Heymann and Feng Lin, Member, IEEE Abstract Nondeterminism in discrete-event
More informationAchieving Fault-tolerance and Safety of Discrete-event Systems through Learning
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning Jin Dai, Ali Karimoddini,
More informationA Discrete Event Systems Approach for Protocol Conversion
A Discrete Event Systems Approach for Protocol Conversion Ratnesh Kumar Sudhir Nelvagal Department of Electrical Engineering University of Kentucky Lexington, KY 40506-0046 Steven I. Marcus Department
More informationSupervisory Control of Timed Discrete-Event Systems under Partial Observation
558 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 40, NO. 3, MARCH 1995 Supervisory Control of Timed Discrete-Event Systems under Partial Observation F. Lin and W. M. Wonham I I 1 7 7 7 Fig. 1. (!-traffic
More informationMODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS. Max H. de Queiroz*, José E. R. Cury**
MODULAR MULTITASKING SUPERVISORY CONTROL OF COMPOSITE DISCRETE-EVENT SYSTEMS Max H. de Queiroz*, José E. R. Cury** * GEMM CEFET/SC Florianópolis SC 88020-301 Brazil maxqueiroz@cefetsc.edu.br ** LCMI DAS
More informationSupervisor Localization for Large-Scale Discrete-Event Systems under Partial Observation
To appear in the International Journal of Control Vol. 00, No. 00, Month 0XX, 1 1 Supervisor Localization for Large-Scale Discrete-Event Systems under Partial Observation Renyuan Zhang a, Kai Cai b a School
More informationDecentralized Failure Diagnosis of Discrete Event Systems
IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL., NO., 2005 1 Decentralized Failure Diagnosis of Discrete Event Systems Wenbin Qiu, Student Member, IEEE, and Ratnesh Kumar,
More informationFailure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications
Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with
More informationFeng Lin. Abstract. Inspired by thewell-known motto of Henry David Thoreau [1], that government
That Supervisor Is Best Which Supervises Least Feng Lin Department of Electrical and Computer Engineering Wayne State University, Detroit, MI 48202 Abstract Inspired by thewell-known motto of Henry David
More informationPSPACE-completeness of Modular Supervisory Control Problems
PSPACE-completeness of Modular Supervisory Control Problems Kurt Rohloff and Stéphane Lafortune Department of Electrical Engineering and Computer Science The University of Michigan 1301 Beal Ave., Ann
More informationSymbolic Decentralized Supervisory Control
Symbolic Decentralized Supervisory Control SYMBOLIC DECENTRALIZED SUPERVISORY CONTROL BY URVASHI AGARWAL, B.Eng. a thesis submitted to the department of computing & software and the school of graduate
More informationSupervisor Localization of Discrete-Event. Systems with Infinite Behavior
Supervisor Localization of Discrete-Event 1 Systems with Infinite Behavior (October 25, 2017) Renyuan Zhang 1, Kai Cai 2 arxiv:1710.08751v1 [cs.sy] 24 Oct 2017 Abstract Recently we developed supervisor
More informationRepresentation of Supervisory Controls using State Tree Structures, Binary Decision Diagrams, Automata, and Supervisor Reduction
Representation of Supervisory Controls using State Tree Structures, Binary Decision Diagrams, Automata, and Supervisor Reduction Wujie Chao 1, Yongmei Gan 2, Zhaoan Wang 3, W. M. Wonham 4 1. School of
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
More informationSupervisory Control of Manufacturing Systems with Time Specifications
Supervisory Control of Manufacturing Systems with Time Specifications Alexander Schaub Institute of Automatic Control Engineering Technische Universität München Joint Advanced Student School 2008 Bibliography
More informationBridging the Gap between Reactive Synthesis and Supervisory Control
Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan)
More informationSUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH
University of Kentucky UKnowledge University of Kentucky Doctoral Dissertations Graduate School 2002 SUPERVISORY CONTROL AND FAILURE DIAGNOSIS OF DISCRETE EVENT SYSTEMS: A TEMPORAL LOGIC APPROACH Shengbing
More informationBisimulation, the Supervisory Control Problem and Strong Model Matching for Finite State Machines
Discrete Event Dynamic Systems: Theory and Applications, 8, 377 429 (1998) c 1998 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Bisimulation, the Supervisory Control Problem and
More informationNonblocking Supervisory Control. of Nondeterministic Systems. Michael Heymann 1 and Feng Lin 2. Abstract
Nonblocking Supervisory Control of Nondeterministic Systems Michael Heymann 1 and Feng Lin 2 Abstract In this paper we extend the theory of supervisory control of nondeterministic discrete-event systems,
More informationRobust Supervisory Control of a Spacecraft Propulsion System
1 Robust Supervisory Control of a Spacecraft Propulsion System Farid Yari, Shahin Hashtrudi-Zad*, and Siamak Tafazoli In this paper the theory of supervisory control of discrete-event systems is used to
More informationDecentralized vs. Monolithic Control of Automata and Weighted Automata
Decentralized vs. Monolithic Control of Automata and Weighted Automata Jan Komenda INSTITUTE of MATHEMATICS Academy of Sciences Czech Republic Institute of Mathematics, Brno branch, November 11, 2016 Outline
More informationFault Tolerant Controllability
2015 American Control Conference Palmer House Hilton July 1-3, 2015. Chicago, IL, USA Fault Tolerant Controllability Simon Radel, Aos Mulahuwaish, and Ryan J. Leduc Abstract In this paper we investigate
More informationpoint, examples of decentralized discrete-event systems control have primarily served a pedagogical and mathematical purpose and have been highly simp
The Computational Complexity of Decentralized Discrete-Event Control Problems Karen Rudie Jan C. Willems Institute for Mathematics Mathematics Institute and its Applications University of Groningen University
More informationRelative Observability and Coobservability of Timed Discrete-Event Systems
TSpace Research Repository tspace.library.utoronto.ca Relative Observability and Coobservability of Timed Discrete-Event Systems Kai Cai, Renyuan Zhang, and W. M. Wonham Version Post-Print/Accepted Manuscript
More informationHierarchical Design of Discrete Event Controllers: An Automated Manufacturing System Case Study
Hierarchical Design of Discrete Event Controllers: An Automated Manufacturing System Case Study Technical Report Sebastian Perk, Klaus Schmidt and Thomas Moor Lehrstuhl für Regelungstechnik Friedrich-Alexander
More informationof Kentucky, Lexington, KY USA,
Controlled Petri Nets: A Tutorial Survey L. E. Holloway 1 and B. H. Krogh 2 1 Center for Manufacturing Systems and Dept. of Electrical Engineering, University of Kentucky, Lexington, KY 40506-0108 USA,
More informationWhat Information Really Matters in Supervisor Reduction?
What Information Really Matters in Supervisor Reduction? Rong Su 1 arxiv:1608.04104v1 [cs.sy] 14 Aug 2016 Abstract To make a supervisor comprehensible to a layman has been a long-lasting goal in the supervisory
More informationIntersection Based Decentralized Diagnosis: Implementation and Verification
Intersection Based Decentralized Diagnosis: Implementation and Verification Maria Panteli and Christoforos N. Hadjicostis Abstract We consider decentralized diagnosis in discrete event systems that are
More informationDiagnosis of Repeated/Intermittent Failures in Discrete Event Systems
Diagnosis of Repeated/Intermittent Failures in Discrete Event Systems Shengbing Jiang, Ratnesh Kumar, and Humberto E. Garcia Abstract We introduce the notion of repeated failure diagnosability for diagnosing
More informationIEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 40, NO. 3, JUNE /$ IEEE
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 40, NO. 3, JUNE 2010 951 Correspondence State-Feedback Control of Fuzzy Discrete-Event Systems Feng Lin and Hao Ying Abstract
More informationLimited Lookahead Control of Discrete-Event Systems: Cost, Probability, and State Space
Limited Lookahead Control of Discrete-Event Systems: Cost, Probability, and State Space By Creag Winacott A thesis submitted to the Graduate Program in Computing in conformity with the requirements for
More informationIN THIS paper we investigate the diagnosability of stochastic
476 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 50, NO 4, APRIL 2005 Diagnosability of Stochastic Discrete-Event Systems David Thorsley and Demosthenis Teneketzis, Fellow, IEEE Abstract We investigate
More informationDecentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions
Decentralized Diagnosis of Discrete Event Systems using Unconditional and Conditional Decisions Yin Wang, Tae-Sic Yoo, and Stéphane Lafortune Abstract The past decade has witnessed the development of a
More informationTowards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems
2014 American Control Conference (ACC) June 4-6, 2014. Portland, Oregon, USA Towards Decentralized Synthesis: Decomposable Sublanguage and Joint Observability Problems Liyong Lin, Alin Stefanescu, Rong
More informationSemi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER
Semi-asynchronous Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER 2017 NC A&T State University http://www.ncat.edu/ Alejandro White Semi-asynchronous http://techlav.ncat.edu/
More informationOn Properties and State Complexity of Deterministic State-Partition Automata
On Properties and State Complexity of Deterministic State-Partition Automata Galina Jirásková 1, and Tomáš Masopust 2, 1 Mathematical Institute, Slovak Academy of Sciences Grešákova 6, 040 01 Košice, Slovak
More informationA look at the control of asynchronous automata
A look at the control of asynchronous automata 1 1 Introduction Anca Muscholl, Igor Walukiewicz and Marc Zeitoun LaBRI Bordeaux Universtity, France In the simplest case, the controller synthesis problem
More informationREPORT MAS-R0404 DECEMBER
C e n t r u m v o o r W i s k u n d e e n I n f o r m a t i c a MAS Modelling, Analysis and Simulation Modelling, Analysis and Simulation Approximating the minimal-cost sensor-selection for discrete-event
More informationSymbolic Hierarchical Interface-based Supervisory Control
Symbolic Hierarchical Interface-based Supervisory Control Symbolic Synthesis and Verification of Hierarchical Interface-based Supervisory Control By Raoguang Song, B.Eng. A Thesis Submitted to the School
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More informationDiagnosability Analysis of Discrete Event Systems with Autonomous Components
Diagnosability Analysis of Discrete Event Systems with Autonomous Components Lina Ye, Philippe Dague To cite this version: Lina Ye, Philippe Dague. Diagnosability Analysis of Discrete Event Systems with
More informationCoordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems
Discrete Event Dynamic Systems: Theory and Applications, 10, 33 86 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Coordinated Decentralized Protocols for Failure Diagnosis
More informationMODULAR SUPERVISORY CONTROL OF ASYNCHRONOUS AND HIERARCHICAL FINITE STATE MACHINES
MODULAR SUPERVISORY CONTROL OF ASYNCHRONOUS AND HIERARCHICAL FINITE STATE MACHINES B. Gaudin, H. Marchand VerTeCs Team, Irisa, Campus Universitaire de Beaulieu, 35042 Rennes, France E-mail: {bgaudin,hmarchan}@irisa.fr,
More informationOnline Failure Diagnosis of Stochastic Discrete Event Systems
Online Failure iagnosis of Stochastic iscrete Event Systems Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Abstract This paper deals with the detection of (permanent) fault in the setting
More informationSemi-asynchronous Fault Diagnosis of Discrete Event Systems
1 Semi-asynchronous Fault Diagnosis of Discrete Event Systems Alejandro White, Student Member, IEEE, Ali Karimoddini, Senior Member, IEEE Abstract This paper proposes a diagnostics tool for a Discrete-
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1 Stavros Tripakis 2 VERIMAG Technical Report TR-2004-26 November 2004 Abstract We introduce problems of decentralized
More informationWA9-11 :OO. On the Controllability of Hybrid Control Systems
, WA9-11 :OO J. A. Stiver and P. J. Antsaklis, "On the Controllability of Hybrid Control Systems, P roc 3 2nd EEE kocrrdlnga of thr 32nd contwmcr MoolJwlUldC~ San Antonlo, loxia Docombat 1995 On the Controllability
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication Stavros Tripakis Abstract We introduce problems of decentralized control with communication, where we explicitly
More informationCOMPLEXITY REDUCTION IN DISCRETE EVENT SYSTEMS
COMPLEXITY REDUCTION IN DISCRETE EVENT SYSTEMS by Rajinderjeet Singh Minhas A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy, Graduate Department of Electrical
More informationHierarchical Interface-based Supervisory Control of a Flexible Manufacturing System
1 Hierarchical Interface-based Supervisory Control of a Flexible Manufacturing System R.J. Leduc, M. Lawford, and P. Dai December 22, 2005 Abstract Flexible manufacturing systems have long been touted
More informationOn Detectability Of Networked Discrete Event Systems
Wayne State University Wayne State University Dissertations 1-1-2017 On Detectability Of Networked Discrete Event Systems Yazeed Sasi Wayne State University, Follow this and additional works at: http://digitalcommons.wayne.edu/oa_dissertations
More informationA. Disjunctive Prognosers
2009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 10-12, 2009 FrB11.4 Multi-Decision Decentralized Prognosis of Failures in Discrete Event Systems Ahmed Khoumsi and Hicham
More informationHierarchical Hybrid Symbolic Robot Motion Planning and Control
Asian Journal of Control, Vol. 00, No. 0, pp. 1 11, Month 2008 Published online in Wiley InterScience (www.interscience.wiley.com) DOI: 10.1002/asjc.0000 Hierarchical Hybrid Symbolic Robot Motion Planning
More informationHierarchical Interface-Based Decentralized. Supervisory Control
Hierarchical Interface-Based Decentralized Supervisory Control HIERARCHICAL INTERFACE-BASED DECENTRALIZED SUPERVISORY CONTROL BY HUAILIANG LIU, M.Eng. a thesis submitted to the department of computing
More informationOptimal Supervisory Control of Probabilistic Discrete Event Systems
1110 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 5, MAY 2012 Optimal Supervisory Control of Probabilistic Discrete Event Systems Vera Pantelic and Mark Lawford, Senior Member, IEEE Abstract Probabilistic
More informationTimed Fault Tolerant Supervisory Control
Timed Fault Tolerant Supervisory Control TIMED FAULT TOLERANT SUPERVISORY CONTROL BY AMAL ALSUWAIDAN, B. IT. a thesis submitted to the department of computing and software and the school of graduate studies
More informationTECHNICAL RESEARCH REPORT
TECHNICAL RESEARCH REPORT Extension Based Limited Lookahead Supervision of Discrete Event Systems by R. Kumar, H.M. Cheung, S.I. Marcus T.R. 95-78 ISR INSTITUTE FOR SYSTEMS RESEARCH Sponsored by the National
More informationA Compositional Approach for Verifying Sampled-Data Supervisory Control
A Compositional Approach for Verifying Sampled-Data Supervisory Control A Compositional Approach for Verifying Sampled-Data Supervisory Control by MAHVASH BALOCH, M.Sc. A Thesis Submitted to the School
More informationSupervisory control for collision avoidance in vehicular networks with imperfect measurements
Supervisory control for collision avoidance in vehicular networks with imperfect measurements The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story
More informationAttack-Resilient Supervisory Control of Discrete-Event Systems
1 Attack-Resilient Supervisory Control of Discrete-Event Systems Yu Wang, Alper Kamil Bozkurt and Miroslav Pajic arxiv:194.3264v1 [cs.fl] 5 Apr 219 Abstract In this work, we study the problem of supervisory
More informationExtending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively
12th IFAC/IEEE Workshop on Discrete Event Systems Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata Enforcing Controllability Least Restrictively A.-K. Schmuck S. Schneider
More informationMonitoring and Active Diagnosis for Discrete-Event Systems
Monitoring and Active Diagnosis for Discrete-Event Systems Elodie Chanthery, Yannick Pencolé LAAS-CNRS, University of Toulouse, Toulouse, France (e-mail: [elodie.chanthery, yannick.pencole]@laas.fr) University
More informationDecentralized Failure Diagnosis of Stochastic Discrete Event Systems
Decentralized Failure Diagnosis of Stochastic Discrete Event Systems Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Abstract In decentralized diagnosis the system behavior is monitored
More informationResolution of Initial-State in Security Applications of DES
Resolution of Initial-State in Security Applications of DES Christoforos N. Hadjicostis Abstract A non-deterministic labeled finite automaton is initial-state opaque if the membership of its true initial
More informationResilient Supervisory Control of Autonomous Intersections in the Presence of Sensor Attacks
Resilient Supervisory Control of Autonomous Intersections in the Presence of Sensor Attacks Amin Ghafouri and Xenofon D. Koutsoukos Abstract Cyber-physical systems (CPS), such as autonomous vehicles crossing
More informationA Scalable Jointree Algorithm for Diagnosability
A Scalable Jointree Algorithm for Diagnosability Anika Schumann Advanced Computing Research Centre University of South Australia Mawson Lakes, SA 5095, Australia anika.schumann@cs.unisa.edu.au Jinbo Huang
More informationA structural approach to the non-blocking supervisory control of discrete-event systems
DOI 10.1007/s00170-008-1555-9 ORIGINAL ARTICLE A structural approach to the non-blocking supervisory control of discrete-event systems Lei Feng & Kai Cai & W. M. Wonham Received: 27 November 2007 / Accepted:
More informationOptimal Discrete Event Supervisory Control of Aircraft Gas Turbine Engines
Optimal Discrete Event Supervisory Control of Aircraft Gas Turbine Engines Jinbo Fu, Murat Yasar, Asok Ray Mechanical Engineering Department The Pennsylvania State University University Park, PA 68 Keywords:
More informationc 2011 Nisha Somnath
c 2011 Nisha Somnath HIERARCHICAL SUPERVISORY CONTROL OF COMPLEX PETRI NETS BY NISHA SOMNATH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Aerospace
More informationLinear Time Logic Control of Discrete-Time Linear Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada
More informationCONTROL AND DEADLOCK RECOVERY OF TIMED PETRI NETS USING OBSERVERS
5 e Conférence Francophone de MOdélisation et SIMulation Modélisation et simulation pour l analyse et l optimisation des systèmes industriels et logistiques MOSIM 04 du 1 er au 3 septembre 2004 - Nantes
More informationExploiting symmetry of state tree structures for discrete-event systems with parallel components
TSpace Research Repository tspace.library.utoronto.ca Exploiting symmetry of state tree structures for discrete-event systems with parallel components Ting Jiao, Yongmei Gan, Guochun Xiao & W. M. Wonham
More informationA Hybrid Bellman Equation for Systems with Regional Dynamics
A Hybrid Bellman Equation for Systems with Regional ynamics Angela Schöllig, Peter E. Caines, Magnus Egerstedt, and Roland Malhamé Abstract In this paper, we study hybrid systems with regional dynamics,
More informationAlternating-Time Temporal Logic
Alternating-Time Temporal Logic R.Alur, T.Henzinger, O.Kupferman Rafael H. Bordini School of Informatics PUCRS R.Bordini@pucrs.br Logic Club 5th of September, 2013 ATL All the material in this presentation
More informationFailure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements
Failure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Dept. of Elec. & Comp. Eng., Iowa
More informationDesigning Petri Net Supervisors from LTL Specifications
Robotics: Science and Systems 20 Los Angeles, CA, USA, June 27-30, 20 Designing Petri Net Supervisors from LTL Specifications Bruno Lacerda and Pedro U. Lima Institute for Systems and Robotics Instituto
More informationConcurrent Processes and Reaction
Concurrent Processes and Reaction Overview External and internal actions Observations Concurrent process expressions Structural congruence Reaction References Robin Milner, Communication and Concurrency
More informationIndustrial Automation (Automação de Processos Industriais)
Industrial Automation (Automação de Processos Industriais) Discrete Event Systems http://users.isr.ist.utl.pt/~jag/courses/api1516/api1516.html Slides 2010/2011 Prof. Paulo Jorge Oliveira Rev. 2011-2015
More informationSymbolic sub-systems and symbolic control of linear systems
Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005 Seville, Spain, December 12-15, 2005 MoA01.4 Symbolic sub-systems and symbolic control of linear
More informationThe complexity of recursive constraint satisfaction problems.
The complexity of recursive constraint satisfaction problems. Victor W. Marek Department of Computer Science University of Kentucky Lexington, KY 40506, USA marek@cs.uky.edu Jeffrey B. Remmel Department
More informationSupervisory Control of Manufacturing Systems with Time Specifications
Joint Advanced Student School 2008, St. Petersburg Supervisory Control of Manufacturing Systems with Time Specifications Final Report by Alexander Schaub born on 21.02.1985 address: Ferdinand-Millerstraße
More informationDiagnosis of Discrete-Event Systems in Rules-based Model using First-order Linear Temporal Logic
Diagnosis of Discrete-Event Systems in Rules-based Model using First-order Linear Temporal Logic Zhongdong Huang and Siddhartha Bhattacharyya Dept. of Elec. & Comp. Eng., Univ. of Kentucky, Lexington,
More informationTIMED-EVENT-STATE-BASED DIAGNOSER FOR MANUFACTURING SYSTEMS
TIMED-EVENT-STATE-BASED DIAGNOSER FOR MANUFACTURING SYSTEMS M. Sayed-Mouchaweh, A. Philippot, V. Carre-Menetrier, B. Riera Universite de Reims, CReSTIC -LAM Moulin de la Mousse B.P. 39 5687 REIMS Cedex
More information