<?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-22T23:15:41Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9678" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9678</identifier><datestamp>2017-03-21T21:24:34Z</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="author" authority="37f261f5-1487-4082-8a48-d17c30c45d67" confidence="600">Faghihekhorasani, Fathiyeh</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-09-21T14:18:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-09-21T14:18:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-09-21</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9678</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This dissertation concentrates on the problem of automated synthesis and repair of fault-tolerant systems. In particular, given the required specification of the system, our goal is to synthesize a fault-tolerant system, or repair an existing one. We study this problem for two classes of timed and distributed systems.&#xd;
&#xd;
In the context of timed systems, we focus on efficient synthesis of fault-tolerant timed models from their  fault-intolerant version. Although the complexity of the synthesis problem is known to be polynomial time  in the size of the time-abstract bisimulation of the input model, the state of the art lacked synthesis &#xd;
algorithms that can be efficiently implemented. This is in part due to the fact that synthesis is in general a &#xd;
challenging problem and its complexity is significantly magnified in the context of timed systems. We &#xd;
propose an algorithm that takes a timed automaton, a set of fault actions, and a set of safety and bounded-time response properties as input, and utilizes a space-efficient symbolic representation of the timed &#xd;
automaton (called the zone graph) to synthesize a fault-tolerant timed automaton as output. The output &#xd;
automaton satisfies strict phased recovery, where it is guaranteed that the output model behaves similarly &#xd;
to the input model in the absence of faults and in the presence of faults, fault recovery is achieved in two &#xd;
phases, each satisfying certain safety and timing constraints.&#xd;
&#xd;
In the context of distributed systems, we study the problem of synthesizing fault-tolerant systems from their &#xd;
intolerant versions, when the number of processes is unknown. To synthesize a distributed fault-tolerant &#xd;
protocol that works for systems with any number of processes, we use counter abstraction. Using this &#xd;
abstraction, we deal with a finite-state abstract model to do the synthesis. Applying our proposed algorithm, &#xd;
we successfully synthesized a fault-tolerant distributed agreement protocol in the presence of Byzantine fault. Although the synthesis problem is known to be NP-complete in the state space of the input &#xd;
protocol (due to partial observability of processes) in the non-parameterized setting, our parameterized &#xd;
algorithm manages to synthesize a solution for a complex problem such as Byzantine agreement  within less than two minutes.&#xd;
&#xd;
A system may reach a bad state due to wrong initialization or fault occurrence. One of the well-known &#xd;
types of distributed fault-tolerant systems are self-stabilizing systems. These are the systems that converge &#xd;
to their legitimate states starting from any state, and if no fault occurs, stay in legitimate states thereafter. &#xd;
We propose an automated sound and complete method to synthesize self-stabilizing systems starting from &#xd;
the desired topology and type of the system. Our proposed method is based on SMT-solving, where the &#xd;
desired specification of the system is formulated as SMT constraints. We used the Alloy solver to &#xd;
implement our method, and successfully synthesized some of the well-known self-stabilizing algorithms. &#xd;
We extend our method to support a type of stabilizing algorithm called ideal-stabilization, and also the case &#xd;
when the set of legitimate states is not explicitly known.&#xd;
&#xd;
Quantitative metrics such as recovery time are crucial in self-stabilizing systems when used in practice &#xd;
(such as in networking applications). One of these metrics is the average recovery time. Our automated &#xd;
method for synthesizing self-stabilizing systems generate some solution that respects the desired system &#xd;
specification, but it does not take into account any quantitative metrics. We study the problem of repairing &#xd;
self-stabilizing systems (where only removal of transitions is allowed) to satisfy quantitative limitations. &#xd;
The metric under study is average recovery time, which characterizes the performance of stabilizing &#xd;
programs. We show that the repair problem is NP-complete in the state space of the given system.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Synthesis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Fault-Tolerance</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Distributed Systems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Real-Time Systems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Self-Stabilization</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Automated Synthesis of Timed and Distributed Fault-Tolerant Systems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Computer Science (David R. Cheriton School of)</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</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>