1-7hit |
This paper deals with the decentralized supervisory control problems of uncertain discrete event systems which are represented as a set of some possible models. For a given global specification, this paper provides the necessary and sufficient conditions for the existence of local supervisors to achieve the specification under model uncertainty.
In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.
This paper presents a framework for the nonblocking supervisory control of nondeterministic discrete event systems (DESs) using multiple deterministic model. Necessary and sufficient conditions for the existence of a multiple model nonblocking supervisor are obtained for a multiple deterministic model. We show that a multiple model nonblocking supervisor guarantees the nonblockingness of an original nondeterministic system.
This paper addresses a robust supervisory control problem for uncertain timed discrete event systems (DESs) modeled as a set of some possible timed models. To avoid the state space explosion problem caused by tick transitions in timed models, the notion of eligible time bounds is presented. Based on the notion and activity (logical) models, this paper shows how the controllability condition of a given language specification is presented as a necessary and sufficient condition for the existence of a robust supervisor to achieve the specification for any timed model in the set.
In a real-time system, when the execution of a task is preempted by another task, the interrupted task falls into a blocked state. Since its re-execution begins from the interrupted point generally, the task's timer containing the remaining time until its completion should be maintained in the blocked state. This is the reason for introducing the notion of memorable events in this paper. We present a new timed discrete event model (TDEM) that adds the memorable events to the TDEM framework of Brandin and Wonham (1994). Using supervisory control theory upon the proposed TDEM, we analyze the schedulability of preemptable periodic and sporadic tasks executing on a uniprocessor.
In this paper we develop a robust control theory to achieve fault-tolerant behaviors of timed discrete event systems (DESs) with model uncertainty represented as a set of some possible models. To demonstrate the effectiveness of the proposed theory, we provide a case study of a resistance spot welding process.
For an uncertain discrete event system (DES) modeled as a set of some possible nondeterministic automata, we address robust supervisory control problems. Based on language models, this paper presents the existence conditions of a robust nonblocking (RN) supervisor that guarantees the absence of blocked states in a closed-loop system. We show that an RN supervisor achieves both a given language specification and the nonblocking characteristics of any nondeterministic automata of the set.