Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

We summarize the main results proved in recent work on the parameterized verification of safetyproperties for ad hoc network protocols. We consider a model in which the communication topologyof a network is represented as a graph. Nodes represent states of individual processes. Adjacentnodes represent single-hop neighbors. Processes are finite state automata that communicate via se-lective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For thismodel we consider a decision problem that can be expressed as the verification of the existence ofan initial topology in which the execution of the protocol can lead to a configuration with at leastone node in a certain state. The decision problem is parametric both on the size and on the form ofthe communication topology of the initial configurations. We draw a complete picture of the decid-ability and complexity boundaries of this problem according to various assumptions on the possibletopologies.

[1]  Kedar S. Namjoshi,et al.  On model checking for non-deterministic infinite-state systems , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[2]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[3]  Giorgio Delzanno,et al.  On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks , 2011, FoSSaCS.

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

[5]  Bengt Jonsson,et al.  Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols , 2008, TACAS.

[6]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[7]  Ivan Lanese,et al.  An operational semantics for a calculus for wireless systems , 2010, Theor. Comput. Sci..

[8]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[9]  Giorgio Delzanno,et al.  Parameterized Verification of Ad Hoc Networks , 2010, CONCUR.

[10]  Guoli Ding,et al.  Subgraphs and well-quasi-ordering , 1992, J. Graph Theory.

[11]  C. R. Ramakrishnan,et al.  Query-Based Model Checking of Ad Hoc Network Protocols , 2009, CONCUR.

[12]  K. V. S. Prasad.  A Calculus of Broadcasting Systems , 1991, Sci. Comput. Program..

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

[14]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[15]  Dahlia Malkhi,et al.  K-clustering in wireless ad hoc networks , 2002, POMC '02.

[16]  Thomas A. Henzinger,et al.  Forward Analysis of Depth-Bounded Processes , 2010, FoSSaCS.

[17]  S.A. Smolka,et al.  MODELNG THE AODV ROUTING PROTOCOL IN THE ω-CALCULUS , 2006, 2006 IEEE Long Island Systems, Applications and Technology Conference.

[18]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

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

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

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

[22]  Philippe Schnoebelen,et al.  Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets , 2010, MFCS.

[23]  Roland Meyer,et al.  On Boundedness in Depth in the pi-Calculus , 2008, IFIP TCS.

[24]  L.F.W. van Hoesel,et al.  Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks , 2007, IFM.

[25]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[26]  Asif Zaman,et al.  MOORE GRAPHS OF DIAMETER 2 AND 3 , 2010 .

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