Please use this identifier to cite or link to this item:
Title: Time optimal supervisory control of discrete event systems
Authors: Ahmad Reza Shehabinia
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Control engineering
Issue Date: 2017
Source: Ahmad Reza Shehabinia. (2017). Time optimal supervisory control of discrete event systems. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: 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 logic correctness 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.
DOI: 10.32657/10356/69560
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
main.pdf1.09 MBAdobe PDFThumbnail

Page view(s)

Updated on Nov 30, 2021

Download(s) 50

Updated on Nov 30, 2021

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.