{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/14047"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/14047","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Symbolic Decentralized Supervisory Control","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt; &lt;p&gt;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).&lt;/p&gt;","abstract_has_math":false,"creators":["Agarwal, Urvashi"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Leduc, R. J.","Ricker, Laurie","Mohrenschildt, M. V."],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-04","date_published":"2014-04","updated_at":"2026-11-18T19:33:50Z","subjects":["Discrete Event Systems","Decentralized Supervisory Control","State-based co-observability","SB co-observability","Algorithms","Computational complexity","Binary Decision Diagrams","Controls and Control Theory"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/15065"],"render_values":[{"text":"https://doi.org/10.71548/15065","href":"https://doi.org/10.71548/15065","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8876","9947","5406922"],"render_values":[{"text":"opendissertations/8876","href":null,"code":true},{"text":"9947","href":null,"code":true},{"text":"5406922","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/14047","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/14047","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F14047","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Leduc, R. J.","Ricker, Laurie","Mohrenschildt, M. V."]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Agarwal, Urvashi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T17:06:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T17:06:08Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2014-03-28"]},{"key":"dc:date.issued","label":"Date","values":["2014-04"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Discrete Event Systems","Decentralized Supervisory Control","State-based co-observability","SB co-observability","Algorithms","Computational complexity","Binary Decision Diagrams","Controls and Control Theory"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8876","9947","5406922"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/14047","https://doi.org/10.71548/15065"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science (MSc)"]},{"key":"dc:title","label":"Title","values":["Symbolic Decentralized Supervisory Control"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Leduc, R. J.","Ricker, Laurie","Mohrenschildt, M. V."],"dc:contributor.department":["Computing and Software"],"dc:creator":["Agarwal, Urvashi"],"dc:date.accessioned":["2014-06-18T17:06:08Z"],"dc:date.available":["2014-06-18T17:06:08Z"],"dc:date.created":["2014-03-28"],"dc:date.issued":["2014-04"],"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>"],"dc:description.degree":["Master of Science (MSc)"],"dc:identifier.other":["opendissertations/8876","9947","5406922"],"dc:identifier.uri":["http://hdl.handle.net/11375/14047","https://doi.org/10.71548/15065"],"dc:subject":["Discrete Event Systems","Decentralized Supervisory Control","State-based co-observability","SB co-observability","Algorithms","Computational complexity","Binary Decision Diagrams","Controls and Control Theory"],"dc:title":["Symbolic Decentralized Supervisory Control"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:33:50Z"}