A Summary of Some Discrete-Event System Control Problems

Rudie, Karen

doi:10.1007/978-3-642-18098-9_2

Cited by 3 publications

(1 citation statement)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The unified framework of supervisory control theory of DES proposed by Ramadge and Wonham relies on the modeling using conventional automaton; where basically, transitions are seen as letters and DES as finite state machines [57]. The following is the essence of the DES control problems [59]. In the process G, whose behavior can be seen as event sequences, some event sequences in G are unwanted (e.g., because of violating some safety specifications).…”

Section: Historical Background: Supervisory Control Theorymentioning

confidence: 99%

Time optimal supervisory control of discrete event systems

Ahmad¹

View full text Add to dashboard Cite

This thesis focuses on the time-related performance objectives in supervisor synthesis of discrete event systems (DES). With this purpose in mind, we exploit the finite-state timed-weighted automaton as the modeling formalism. First, we present the concept of throughput to evaluate the time-performance of systems with cyclic behaviors. We formulate the supervisory synthesis problem ensuring both logiccorrectness and optimal throughput. After showing the existence of the supremal controllable sublanguage with maximum throughput, an algorithm is provided to compute such a supervisor. In the sequel, we model an operational and scheduling problem under multiple job deadlines, where each job is represented by a finite language and has to be completed within a finite period. The first step is to compute the supremal controllable job satisfaction sublanguage where all jobs and deadlines are met. In the case of nonempty supremal sublanguage, by adding proper delays to controllable transitions, we seek for one of the maximal controllable sublanguages that ensure the minimum total job earliness. If the supremal sublanguage is empty, we will relax some of the job deadlines, and compute a maximal controllable minimum-earliness.

show abstract

Section: Historical Background: Supervisory Control Theorymentioning

confidence: 99%

Time optimal supervisory control of discrete event systems

Ahmad¹

View full text Add to dashboard Cite

show abstract

Supervisory Control of Distributed Discrete-Event Systems

Komenda

Masopust

Schuppen

2013

Lecture Notes in Control and Information Sciences

View full text Add to dashboard Cite

Transition Complexity of Incomplete DFAs

Gao

Salomaa

Yü

2011

Fundamenta Informaticae

View full text Add to dashboard Cite

We consider the transition complexity of regular languages based on the incomplete deterministic finite automata. We establish tight bounds for the transition complexity of Boolean operations, in the case of union the upper and lower bounds differ by a multiplicative constant two. We show that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity bounds turn out to be similar to the corresponding bounds for state complexity.

show abstract

A Summary of Some Discrete-Event System Control Problems

Cited by 3 publications

References 31 publications

Time optimal supervisory control of discrete event systems

Time optimal supervisory control of discrete event systems

Supervisory Control of Distributed Discrete-Event Systems

Transition Complexity of Incomplete DFAs

Contact Info

Product

Resources

About