Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

Giorgio Delzanno
Arnaud Sangnier
Gianluigi Zavattaro

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.

Invited Paper in Luca Aceto and Mohammad Reza Mousavi: Proceedings First International Workshop on Process Algebra and Coordination (PACO 2011), Reykjavik, Iceland, 9th June 2011, Electronic Proceedings in Theoretical Computer Science 60, pp. 56–65.
Published: 6th August 2011.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: