Parameterized verification of time-sensitive models of ad hoc network protocols

We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is defined by an undirected graph and the behaviour of each node is defined by a timed automaton communicating with its neighbours via broadcast messages. We consider parameterized verification problems formulated in terms of reachability. In particular we are interested in searching for an initial configuration from which an individual node can reach an error state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.

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

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

[3]  Parosh Aziz Abdulla,et al.  On the Verification of Timed Ad Hoc Networks , 2011, FORMATS.

[4]  A. Prasad Sistla,et al.  Reasoning about systems with many processes , 1992, JACM.

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

[6]  Benjamin Aminof,et al.  Parameterized Model Checking of Token-Passing Systems , 2013, VMCAI.

[7]  Parosh Aziz Abdulla,et al.  Model checking of systems with many identical timed processes , 2003, Theor. Comput. Sci..

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

[9]  Lorenzo Clemente,et al.  Decidable Topologies for Communicating Automata with FIFO and Bag Channels , 2014, CONCUR.

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

[11]  Joël Ouaknine,et al.  Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.

[12]  Giorgio Delzanno,et al.  Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks , 2013, LATA.

[13]  E. A. Emerson,et al.  On Reasoning About Rings , 2003, Int. J. Found. Comput. Sci..

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

[15]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[16]  Johann Deneux,et al.  Multi-clock timed networks , 2004, LICS 2004.

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

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

[19]  Giorgio Delzanno,et al.  On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks , 2012, FSTTCS.

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

[21]  Massimo Merro,et al.  A timed calculus for wireless systems , 2011, Theor. Comput. Sci..

[22]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[23]  Giorgio Delzanno,et al.  Parameterized Verification of Broadcast Networks of Register Automata , 2013, RP.

[24]  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).