Abstract
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.
Cite
CITATION STYLE
Kouzapas, D., & Philippou, A. (2011). A process calculus for dynamic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6722 LNCS, pp. 213–227). https://doi.org/10.1007/978-3-642-21461-5_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
