A Process Calculus for Dynamic Networks

• Main Authors: Kouzapas, Dimitrios, Philippou, Anna
• Other Authors: Imperial College London, University of Cyprus Nicosia (UCY), Roberto Bruni, Juergen Dingel, TC 6, WG 6.1
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2011
• Subjects: [INFO]Computer Science [cs]; [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]; Iceland
• Online Access: https://hal.inria.fr/hal-01583319; https://hal.inria.fr/hal-01583319/document; https://hal.inria.fr/hal-01583319/file/978-3-642-21461-5_14_Chapter.pdf; https://doi.org/10.1007/978-3-642-21461-5_14

International audience In 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.