Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/14047
Title: | Symbolic Decentralized Supervisory Control |
Authors: | Agarwal, Urvashi |
Advisor: | Leduc, R. J. Ricker, Laurie Mohrenschildt, M. V. |
Department: | Computing and Software |
Keywords: | Discrete Event Systems;Decentralized Supervisory Control;State-based co-observability;SB co-observability;Algorithms;Computational complexity;Binary Decision Diagrams;Controls and Control Theory;Controls and Control Theory |
Publication Date: | Apr-2014 |
Abstract: | <p>A decentralized discrete-event system (DES) consists of supervisors that are physically distributed. Co-observability is one of the necessary and sufficient conditions for the existence of a decentralized supervisors that correctly solve the control problem. In this thesis we present a state-based definition of co-observability and introduce algorithms for its verification. Existing algorithms for the verification of co-observability do not scale well, especially when the system is composed of many components. We show that the implementation of our state-based definition leads to more efficient algorithms.</p> <p>We present a set of algorithms that use an existing structure for the verification of state-based co-observability (SB Co-observability). A computational complexity analysis of the algorithms show that the state-based implementation of algorithms result in quadratic complexity. Further improvements come from using a more compact way of representing finite-state machines namely Binary Decision Diagrams (BDD).</p> |
URI: | http://hdl.handle.net/11375/14047 |
Identifier: | opendissertations/8876 9947 5406922 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 1.01 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.