Back to search

University of Waterloo

Analysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphs

Abstract

dc:description.abstract

This thesis studies algorithmic aspects of deadlock analysis for parameterized networks of discrete-event systems. A parameterized network consists of a finite, but arbitrarily large, number of interacting finite-state subsystems, each within one of a fixed, finite number of isomorphism classes. While deadlock analysis of such systems is generally undecidable, decidable subproblems have recently been identified. The decision procedure rests on the construction of a finite dependency graph for the network, and the computation of its full, consistent subgraphs. We present a software tool for such computations, and apply it to a train network example that extends beyond the current theoretical framework. The results suggest ways in which the framework could usefully be extended.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Moodi, Mojtaba
Advisor dc:contributor.advisor
  • Thistle, John

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/10641

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Moodi, Mojtaba. Analysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphs. University of Waterloo, 2016. http://hdl.handle.net/10012/10641