A process calculus for dynamic networks
Date
2011ISSN
0302-9743Source
Joint 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 2011Volume
6722 LNCSPages
213-227Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
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. © 2011 IFIP International Federation for Information Processing.