Equational Reasoning on Ad Hoc Networks

We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize restricted broadcast. It allows one to define an ad hoc network with respect to the underlying topologies. We give a sound and complete axiomatization for the recursion-free part of the term algebra CNT, modulo what we call rooted branching computed network bisimilarity.

[1]  Jens Chr. Godskesen.  A Calculus for Mobile Ad Hoc Networks , 2007, COORDINATION.

[2]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[3]  Davide Sangiorgi,et al.  Towards a Calculus For Wireless Systems , 2006, MFPS.

[4]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[5]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks , 2007, MFPS.

[6]  Jan A. Bergstra,et al.  Discrete time process algebra with silent step , 2000, Proof, Language, and Interaction.

[7]  Fatemeh Ghassemi,et al.  Restricted Broadcast Process Theory , 2008, 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods.

[8]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[10]  Chris Hankin,et al.  A framework for security analysis of mobile wireless networks , 2006, Theor. Comput. Sci..

[11]  C. R. Ramakrishnan,et al.  A process calculus for Mobile Ad Hoc Networks , 2010, Sci. Comput. Program..

[12]  Twan Basten,et al.  Branching Bisimilarity is an Equivalence Indeed! , 1996, Inf. Process. Lett..