Back to search

McMaster University

Symbolic Decentralized Supervisory Control

Abstract

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>

Degree

thesis:*
Department dc:contributor.department
Computing and Software
Year dc:date.issued
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Agarwal, Urvashi
Advisors dc:contributor.advisor
  • Leduc, R. J.
  • Ricker, Laurie
  • Mohrenschildt, M. V.

Subjects

dc:subject × 8

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/8876
9947
5406922

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Agarwal, Urvashi. Symbolic Decentralized Supervisory Control. 2014. http://hdl.handle.net/11375/14047