A Process Calculus for Dynamic Networks

Kouzapas, D. and Philippou, A. (2011) A Process Calculus for Dynamic Networks. In: Joint 13th IFIP WG 6.1 International Conference, FMOODS 2011, and 30th IFIP WG 6.1 International Conference, FORTE 2011, Reykjavik, Iceland, 6-9 June 2011, pp. 213-227. ISBN 9783642214608 (doi: 10.1007/978-3-642-21461-5_14)

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Kouzapas, Mr Dimitrios
• Authors: Kouzapas, D., and Philippou, A.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• ISBN: 9783642214608
• Copyright Holders: Copyright © 2011 Springer Verlag
• First Published: First published in Proceedings Joint 13th IFIP WG 6.1 International Conference, FMOODS 2011, and 30th IFIP WG 6.1 International Conference, FORTE 2011
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher.