<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T02:43:59Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/14047" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/14047</identifier><datestamp>2026-09-24T07:58:17Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Leduc, R. J.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Ricker, Laurie</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Mohrenschildt, M. V.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Agarwal, Urvashi</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-06-18T17:06:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-06-18T17:06:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="created" lang="en_US">2014-03-28</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2014-04</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">opendissertations/8876</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">9947</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">5406922</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/14047</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/15065</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;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.&lt;/p> &lt;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).&lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Discrete Event Systems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Decentralized Supervisory Control</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">State-based co-observability</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">SB co-observability</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computational complexity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Binary Decision Diagrams</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Controls and Control Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Controls and Control Theory</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Symbolic Decentralized Supervisory Control</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>