Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks

We study decidability and complexity of verification problems for networks in which nodes communicate via asynchronous broadcast messages. This type of communication is achieved by using a distributed model in which nodes have a local buffer. We consider here safety properties expressed as a coverability problem with an arbitrary initial configuration. This formulation naturally models the search of an initial topology that may lead to an error state in the protocol.

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

[2]  Marsha Chechik,et al.  CONCUR 2008 - Concurrency Theory, 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008. Proceedings , 2008, CONCUR.

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

[4]  Giorgio Delzanno,et al.  Constraint-Based Analysis of Broadcast Protocols , 1999, CSL.

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

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

[7]  Philippe Schnoebelen,et al.  Mixing Lossy and Perfect Fifo Channels , 2008, CONCUR.

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

[9]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[10]  R. Ladner.  The circuit value problem is log space complete for P , 1975, SIGA.

[11]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

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

[13]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[14]  Parosh Aziz Abdulla,et al.  A classification of the expressive power of well-structured transition systems , 2011, Inf. Comput..

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

[16]  Alain Finkel,et al.  Unreliable Channels are Easier to Verify Than Perfect Channels , 1996, Inf. Comput..

[17]  Paul Gastin,et al.  CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings , 2010, CONCUR.

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

[19]  Giorgio Delzanno,et al.  Constraint-Based Verification of Parameterized Cache Coherence Protocols , 2003, Formal Methods Syst. Des..

[20]  Petr Hliněný,et al.  Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings , 2010, MFCS.

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

[22]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks , 2012, ESOP.

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

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

[25]  Giorgio Delzanno,et al.  Verification of Ad Hoc Networks with Node and Communication Failures , 2012, FMOODS/FORTE.

[26]  David Lee,et al.  Formal Techniques for Distributed Systems, Joint 11th IFIP WG 6.1 International Conference FMOODS 2009 and 29th IFIP WG 6.1 International Conference FORTE 2009, Lisboa, Portugal, June 9-12, 2009. Proceedings , 2009, FMOODS/FORTE.

[27]  Parosh Aziz Abdulla,et al.  Undecidable Verification Problems for Programs with Unreliable Channels , 1996, Inf. Comput..