Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/14047
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Leduc, R. J. | en_US |
dc.contributor.advisor | Ricker, Laurie | en_US |
dc.contributor.advisor | Mohrenschildt, M. V. | en_US |
dc.contributor.author | Agarwal, Urvashi | en_US |
dc.date.accessioned | 2014-06-18T17:06:08Z | - |
dc.date.available | 2014-06-18T17:06:08Z | - |
dc.date.created | 2014-03-28 | en_US |
dc.date.issued | 2014-04 | en_US |
dc.identifier.other | opendissertations/8876 | en_US |
dc.identifier.other | 9947 | en_US |
dc.identifier.other | 5406922 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/14047 | - |
dc.description.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> | en_US |
dc.subject | Discrete Event Systems | en_US |
dc.subject | Decentralized Supervisory Control | en_US |
dc.subject | State-based co-observability | en_US |
dc.subject | SB co-observability | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Binary Decision Diagrams | en_US |
dc.subject | Controls and Control Theory | en_US |
dc.subject | Controls and Control Theory | en_US |
dc.title | Symbolic Decentralized Supervisory Control | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Computing and Software | en_US |
dc.description.degree | Master of Science (MSc) | en_US |
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.