On the verification of timed ad hoc networks

Authors:
Parosh Aziz Abdulla;Giorgio Delzanno;Othmane Rezine;Arnaud Sangnier;Riccardo Traverso
Affiliations:
Uppsala University;University of Genova;Uppsala University;Liafa-University Paris 7;University of Genova
Venue:
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Year:
2011

Citing 14
Cited 1

Subgraphs and well-quasi-ordering

Journal of Graph Theory
Model checking of systems with many identical timed processes

Theoretical Computer Science
Timed Petri Nets and BQOs

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
General decidability theorems for infinite-state systems

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Multi-Clock Timed Networks

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Nets with Tokens which Carry Data

Fundamenta Informaticae - PETRI NETS 2007
Query-Based Model Checking of Ad Hoc Network Protocols

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Closed, Open, and Robust Timed Networks

Electronic Notes in Theoretical Computer Science (ENTCS)
Modelling and verification of the LMAC protocol for wireless sensor networks

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
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

Reachability of communicating timed processes

FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is represented by a graph and the behavior of each node is represented by a timed automaton communicating with its neighbors via broadcast messages. We consider verification problems formulated in terms of reachability, starting from initial configurations of arbitrary size, of a configuration that contain at least one occurrence of a node in a certain state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.