Verification of ad hoc networks with node and communication failures

Authors:
Giorgio Delzanno;Arnaud Sangnier;Gianluigi Zavattaro
Affiliations:
University of Genova, Italy;LIAFA, Univ. Paris Diderot, Sorbonne Paris Cité, CNRS, France;INRIA - FOCUS Research Team, University of Bologna, Italy
Venue:
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Year:
2012

Citing 16
Cited 0

A calculus of broadcasting systems

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A Broadcast-based Calculus for Communicating Systems

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On the Verification of Broadcast Protocols

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The circuit value problem is log space complete for P

ACM SIGACT News
A framework for security analysis of mobile wireless networks

Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks (full version)

Information and Computation
Query-Based Model Checking of Ad Hoc Network Protocols

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An operational semantics for a calculus for wireless systems

Theoretical Computer Science
A calculus for mobile ad hoc networks

COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Modelling and verification of the LMAC protocol for wireless sensor networks

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A process calculus for mobile ad hoc networks

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Graph grammar modeling and verification of ad hoc routing protocols

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Graph grammar modeling and verification of ad hoc routing protocols

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Parameterized verification of ad hoc networks

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the power of cliques in the parameterized verification of Ad Hoc networks

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
A timed calculus for wireless systems

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the impact of node and communication failures on the decidability and complexity of parametric verification of a formal model of ad hoc networks. We start by considering three possible types of node failures: intermittence, restart, and crash. Then we move to three cases of communication failures: nondeterministic message loss, message loss due to conflicting emissions, and detectable conflicts. Interestingly, we prove that the considered decision problem (reachability of a control state) is decidable for node intermittence and message loss (either nondeterministic or due to conflicts) while it turns out to be undecidable for node restart/crash, and conflict detection.