A process calculus for dynamic networks

Authors:
Dimitrios Kouzapas;Anna Philippou
Affiliations:
Imperial College, London, UK;University of Cyprus, Cyprus
Venue:
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Year:
2011

Citing 13
Cited 1

Proof methods and pragmatics for parallel programming

Proof methods and pragmatics for parallel programming
A calculus of mobile processes, I

Information and Computation
A calculus of broadcasting systems

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Communication and Concurrency

Communication and Concurrency
On Confluence in the pi-Calculus

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A framework for security analysis of mobile wireless networks

Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks (full version)

Information and Computation
A Calculus for Mobile Ad-hoc Networks with Static Location Binding

Electronic Notes in Theoretical Computer Science (ENTCS)
An operational semantics for a calculus for wireless systems

Theoretical Computer Science
A process calculus for mobile ad hoc networks

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Equational Reasoning on Mobile Ad Hoc Networks

Fundamenta Informaticae
A timed calculus for wireless systems

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering

A semantic analysis of key management protocols for wireless sensor networks

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

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.