Show simple item record

dc.contributor.authorKouzapas, D.en
dc.contributor.authorPhilippou, Annaen
dc.creatorKouzapas, D.en
dc.creatorPhilippou, Annaen
dc.description.abstractIn this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards the verification of a leader-election algorithm for mobile ad hoc networks. © 2011 IFIP International Federation for Information Processing.en
dc.sourceJoint 13th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems, FMOODS 2011 and 31st IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2011en
dc.subjectDistributed computer systemsen
dc.subjectNetwork topologyen
dc.subjectMobile ad hoc networksen
dc.subjectElectric network topologyen
dc.subjectLevels of abstractionen
dc.subjectDynamic networken
dc.subjectFormal methodsen
dc.subjectMultiple transmissionen
dc.subjectProcess calculien
dc.titleA process calculus for dynamic networksen
dc.description.volume6722 LNCSen
dc.description.endingpage227 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied SciencesΤμήμα Πληροφορικής / Department of Computer Science
dc.description.notes<p>Sponsors: International Federation for Information Processing (IFIP)en
dc.description.notesReykjavik Universityen
dc.description.notesCCP Games Icelanden
dc.description.notesConference code: 85734en
dc.description.notesCited By :10</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record