A process calculus for dynamic networks
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 2011
Google Scholar check
MetadataShow full item record
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.
Showing items related by title, author, creator and subject.
Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Samaras, George S.; Chrysanthis, Panos K. (2014)Wireless sensor networks enable users to monitor the physical world at an extremely high fidelity. In order to collect the data generated by these tiny-scale devices, the data management community has proposed the utilization ...
Savva, Giannis; Manousakis, Konstantinos; Ellinas, Georgios (2019)In this work, the concept of network coding (NC) is used in conjunction with the routing and spectrum allocation (RSA) problem to jointly provide security and protection in elastic optical networks (EONs). Specifically, ...
Morgan, Ethan; Skaathun, Britt; Nikolopoulos, Georgios K.; Paraskevis, Dimitrios; Williams, Leslie D.; Smyrnov, Pavlo; Friedman, Samuel R.; Schneider, John A. (2019)Individuals with recent/acute HIV-infection have an increased likelihood of disease transmission. To evaluate effectiveness of identifying recent infections, we compared networks of recently and long-term HIV-infected ...