Show simple item record

dc.contributor.authorGelastou, Marinaen
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorPhilippou, Annaen
dc.creatorGelastou, Marinaen
dc.creatorGeorgiou, Chryssisen
dc.creatorPhilippou, Annaen
dc.description.abstractIn this paper we consider the frameworks of Process Algebra and I/O Automata and we apply both towards the verification of a distributed leader-election protocol. Based on the two experiences we evaluate the approaches and draw initial conclusions with respect to their relative capabilities, strengths and usability. To the best of our knowledge, this is the first hands-on evaluation of the two models, and we view it as the cornerstone for a wider investigation of the strengths and weaknesses of the two methodologies in specifying and verifying (distributed) protocols. © 2008 IEEE.en
dc.sourceProceedings of the 7th IEEE International Symposium on Networking Computing and Applications, NCA 2008en
dc.source7th IEEE International Symposium on Networking Computing and Applications, NCA 2008en
dc.subjectComputer networksen
dc.subjectInternational symposiumen
dc.subjectDistributed protocolsen
dc.subjectProcess algebrasen
dc.titleOn the application of formal methods for specifying and verifying distributed protocolsen
dc.description.endingpage204 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeConference Objecten
dc.description.notes<p>Sponsors: IEEE Comput. Soc. Technical Committee on Distributed Processingen
dc.description.notesAkamai Technologies, Inc.en
dc.description.notesInternational Research Institute on Autonomic Network Computingen
dc.description.notesConference code: 73523en
dc.description.notesCited By :5</p>en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record