test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
School of Graduate Studies - Theses >
Doctoral >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/19327

Title: Timed State Tree Structures: Supervisory Control and Fault Diagnosis
Authors: Saadatpoor, Ali
Advisor: Wonham, Murray
Department: Electrical and Computer Engineering
Keywords: Discrete Event Systems
Hierarchical Systems
Supervisory Control
Fault Diagnosis
State Tree Structures
Issue Date: 15-Mar-2010
Abstract: It is well known that the optimal nonblocking supervisory control problem of timed discrete event systems is NP-hard, subject in particular to state space explosion that is exponential in the number of system components. In this thesis, we propose to manage complexity by organizing the system as a Timed State Tree Structure (TSTS). TSTS are an adaptation of STS to timed Supervisory Control Theory (SCT). Based on TSTS we present an e±cient recursive symbolic algorithm that can perform nonblocking supervisory control design for systems of state size 10^12 and higher. Failure diagnosis is the process of detecting and identifying deviations of a system from its normal behavior using the information available through sensors. A method for fault diagnosis of the TSTS model is proposed. A state based diagnoser is constructed for each timed holon of TSTS. Fault diagnosis is accomplished using the state estimates provided by the timed holon diagnosers. The diagnosers may communicate among each other in order to update their state estimates. At any given time, only a subset of the diagnosers are operational, and as a result, instead of the entire model of the system, only the models of the timed holons associated with the operational diagnosers are used. It is shown that the computational complexity of constructing and storing the transition systems required for diagnosis in the proposed approach is polynomial in the number of system components, whereas in the original monolithic approach the computational complexity is exponential.
URI: http://hdl.handle.net/1807/19327
Appears in Collections:Doctoral
The Edward S. Rogers Sr. Department of Electrical & Computer Engineering - Doctoral theses

Files in This Item:

File Description SizeFormat
Saadatpoor_Ali_200906_PhD_thesis.pdf1.12 MBAdobe PDF
View/Open

This item is licensed under a Creative Commons License
Creative Commons

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

uoft