<?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-22T18:03:01Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/12191" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/12191</identifier><datestamp>2025-03-26T23:31:58Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Trefler, Richard</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="01a4de9c-b748-46aa-af86-faf7c287ce62" confidence="600">Nguyen, Hoang Linh</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-08-24T16:12:20Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-08-24T16:12:20Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-08-24</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2017-08-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/12191</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis is about techniques for the analysis of concurrent and real-time systems.&#xd;
&#xd;
As the first contribution, we describe a technique that incorporates automatic symmetry&#xd;
detection and symmetry reduction in the analysis of systems modeled by timed automata.&#xd;
First, our approach detects structural symmetries arising from process templates of realtime&#xd;
systems, requiring no additional input from the user. Then, the technique involves&#xd;
finding all variables of type process identifier and computing a set of generators that forms&#xd;
a group of automorphisms. Our technique is fully automatic, and not restricted to fully&#xd;
symmetric systems.&#xd;
&#xd;
The second contribution of this thesis is that we combine elements of compositional proof,&#xd;
abstraction and local symmetry to decide whether a safety property holds for every process&#xd;
instance in a parameterized family of real-time process networks. Analysis is performed on&#xd;
a small cut-off network; that is, a small instance whose compositional proof generalizes to&#xd;
the entire parametric family. Our results show that verification is decidable in time polynomial&#xd;
in the state space of the “cut-off” instance. Then we apply these ideas to analyze&#xd;
Fischer’s protocol, CSMA/CD protocol and Train-Bridge protocol.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Symmetry Reduction</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Compositional Verification</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Model Checking</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Formal Method</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Symmetry Reduction and Compositional Verification on Timed Automata</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Trefler, Richard</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>