On the Verification of Timed Ad Hoc Networks

  • Parosh Aziz Abdulla
  • Giorgio Delzanno
  • Othmane Rezine
  • Arnaud Sangnier
  • Riccardo Traverso
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6919)


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.


Model Check Internal Node Transition Relation State Reachability Broadcast Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abdulla, P., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313–321. IEEE Computer Society, Los Alamitos (1996)Google Scholar
  2. 2.
    Abdulla, P., Delzanno, G., Rezine, O., Sangnier, A., Traverso, R.: On the verification of timed ad hoc networks. Disi-11-05. Univ. of Genova (July 2011)Google Scholar
  3. 3.
    Abdulla, P., Deneux, J., Mahata, P.: Multi-clock timed networks. In: LICS 2004, pp. 345–354. IEEE Computer Society, Los Alamitos (2004)Google Scholar
  4. 4.
    Abdulla, P., Nylén, A.: Timed petri nets and bqos. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–70. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Abdulla, P.A., Deneux, J., Mahata, P.: Closed, open, and robust timed networks. ENTCS 138(3), 117–151 (2005)MathSciNetMATHGoogle Scholar
  6. 6.
    Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. TCS 290(1), 241–264 (2003)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313–327. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 441–455. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Delzanno, G., Sangnier, A., Zavattaro, G.: Verification of ad hoc networks with node and communication failures. Disi-11-06. Univ. of Genova (July 2011)Google Scholar
  10. 10.
    Ding, G.: Subgraphs and well quasi ordering. J. of Graph Theory 16(5), 489–502 (1992)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Fehnker, A., van Hoesel, L., Mader, A.: Modelling and verification of the LMAC protocol for wireless sensor networks. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 253–272. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fund. Inf. 88(3), 251–274 (2008)MathSciNetMATHGoogle Scholar
  13. 13.
    Merro, M., Ballardin, F.F., Sibilio, E.: A timed calculus for wireless systems. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 228–243. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Nanz, S., Nielson, F., Nielson, H.: Static analysis of topology-dependent broadcast networks. Inf. Comput. 208(2), 117–139 (2010)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Saksena, M., Wibling, O., Jonsson, B.: Graph grammar modeling and verification of Ad Hoc Routing Protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 18–32. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  16. 16.
    Singh, A., Ramakrishnan, C.R., Smolka, S.A.: Query-based model checking of ad hoc network protocols. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 603–619. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    The uppaal web page, http://www.uppaal.com/

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Parosh Aziz Abdulla
    • 1
  • Giorgio Delzanno
    • 2
  • Othmane Rezine
    • 1
  • Arnaud Sangnier
    • 3
  • Riccardo Traverso
    • 2
  1. 1.Uppsala UniversitySweden
  2. 2.University of GenovaItaly
  3. 3.Liafa-University Paris 7France

Personalised recommendations