Show simple item record

dc.contributor.authorMoodi, Mojtaba 14:58:21 (GMT) 14:58:21 (GMT)
dc.description.abstractThis 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.en
dc.publisherUniversity of Waterlooen
dc.subjectParameterized-Chain Networksen
dc.subjectDependency Graphen
dc.subjectFull, Consistent Subgraphsen
dc.subjectDeadlock analysisen
dc.subjectParameterized networksen
dc.titleAnalysis of Parameterized-Chain Networks: The Dependency Graph and Its Full, Consistent Subgraphsen
dc.typeMaster Thesisen
dc.pendingfalse and Computer Engineeringen and Computer Engineeringen of Waterlooen
uws-etd.degreeMaster of Applied Scienceen
uws.contributor.advisorThistle, John
uws.contributor.affiliation1Faculty of Engineeringen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages