Parameterized Verification of Distributed Algorithms in Dynamic Graphs

Examensarbete för masterexamen

Please use this identifier to cite or link to this item:
Download file(s):
File Description SizeFormat 
CSE 22-03 Kokkou.pdfParameterized Verification of Distributed Algorithms in Dynamic Graphs1.45 MBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKokkou, Maria-
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data och informationstekniksv
dc.description.abstractProblems set in dynamic graphs have recently been gaining more attention. However, automated verification methods for the proposed solutions to these problems have not yet been studied. We aim in this work to provide some first results in this direction by focusing on distributed algorithms set in dynamic rings. This work consists of three main parts. We provide a formalization of the mobile agents and algorithms that are used to solve known problems from the distributed computing literature. We then show that under the most common assumptions for mobile agent capabilities, constructing an automated decision procedure for algorithms that solve the distributed computing problems in dynamic rings is undecidable. Finally, we use a different framework for algorithmic verification called “Regular Model Checking”. In this part, we provide a method to transform algorithms that solve the problems that we study in dynamic graphs into the components that are needed for the application of regular model checking
dc.subjectParameterized verificationsv
dc.subjectdistributed computingsv
dc.subjectmobile agentssv
dc.subjectdynamic graphssv
dc.titleParameterized Verification of Distributed Algorithms in Dynamic Graphssv
dc.type.degreeExamensarbete för masterexamensv
dc.contributor.examinerAhrendt, Wolfgang-
dc.contributor.supervisorPiterman, Nir-
Collection:Examensarbeten för masterexamen // Master Theses

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.