Equational Reasoning on Mobile 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 the behavior of an ad hoc network with respect to the underlying topologies. We give a sound and ground-complete axiomatization for CNT terms with finite-state behavior, modulo what we call rooted branching computed network bisimilarity.

[1]  Mohammad Reza Mousavi,et al.  A framework for performance evaluation and functional verification in stochastic process algebras , 2008, SAC '08.

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

[3]  Traian Muntean,et al.  A broadcast-based calculus for communicating systems , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[4]  Jan Friso Groote,et al.  Syntax and semantics of CRL , 1995 .

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

[6]  Sebastian Nanz,et al.  Mobility Models and Behavioural Equivalence for Wireless Networks , 2009, COORDINATION.

[7]  Jos C. M. Baeten,et al.  A Ground-Complete Axiomatization of Finite State Processes in Process Algebra , 2005, CONCUR.

[8]  Hans-Dieter Ehrich,et al.  Specification of abstract data types , 1996 .

[9]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

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

[11]  Massimo Merro,et al.  An Observational Theory for Mobile Ad Hoc Networks (full version) , 2009, Inf. Comput..

[12]  Rob J. van Glabbeek,et al.  A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours , 1993, MFCS.

[13]  Roberto Casati,et al.  Notes on the , 2009 .

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

[15]  Rob J. van Glabbeek.  Notes on the Methodology of CCS and CSP , 1997, Theor. Comput. Sci..

[16]  Robin Milner,et al.  A Complete Axiomatisation for Observational Congruence of Finite-State Behaviors , 1989, Inf. Comput..

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

[18]  Massimo Merro,et al.  A Timed Calculus for Wireless Systems , 2009, FSEN.

[19]  Jan Friso Groote,et al.  The Formal Specification Language mCRL2 , 2006, MMOSS.

[20]  Jens Chr. Godskesen.  A Calculus for Mobile Ad-hoc Networks with Static Location Binding , 2009, EXPRESS.

[21]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

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

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

[25]  Jan Friso Groote,et al.  Proof Theory for µCRL: A Language for Processes with Data , 1993, Semantics of Specification Languages.

[26]  Jens Chr. Godskesen.  Observables for Mobile and Wireless Broadcasting Systems , 2010, COORDINATION.

[27]  Fatemeh Ghassemi,et al.  Equational Reasoning on Ad Hoc Networks , 2009, FSEN.

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