K. Bhargavan, D. Obradovic, and C. A. Gunter, Formal verification of standards for distance vector routing protocols, Journal of the ACM, vol.49, issue.4, pp.538-576, 2002.
DOI : 10.1145/581771.581775

A. Bouajjani, Y. Jurski, and M. Sighireanu, A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes, TACAS, pp.690-705, 2007.
DOI : 10.1007/978-3-540-71209-1_54
URL : https://hal.archives-ouvertes.fr/hal-00129018

K. Chandy and J. Misra, Proofs of networks of processes, IEEE Transactions on Software Engineering, vol.7, issue.4, 1981.

K. M. Chandy and J. Misra, Parallel Program Design, 1988.
DOI : 10.1007/978-1-4613-9668-0_6

S. Das and D. L. Dill, Counter-Example Based Predicate Discovery in Predicate Abstraction, FMCAD, pp.19-32, 2002.
DOI : 10.1007/3-540-36126-X_2
URL : http://sprout.stanford.edu/PAPERS/FMCAD-DD-2002.ps

G. Delzanno, A. Sangnier, R. Traverso, and G. Zavattaro, On the complexity of parameterized reachability in reconfigurable broadcast networks, FSTTCS Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.289-300, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00740518

G. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Safety Properties in Ad Hoc Network Protocols, PACO, pp.56-65, 2011.
DOI : 10.1007/978-3-642-12032-9_8

G. Delzanno, A. Sangnier, and G. Zavattaro, Verification of Ad Hoc Networks with Node and Communication Failures, LNCS, vol.7273, pp.235-250, 2012.
DOI : 10.1007/978-3-642-30793-5_15
URL : https://hal.archives-ouvertes.fr/hal-00909367

S. Edenhofer and P. Höfner, Towards a rigorous analysis of AODVv2 (DYMO), 2012 20th IEEE International Conference on Network Protocols (ICNP)
DOI : 10.1109/ICNP.2012.6459942

A. Fehnker, R. J. Van-glabbeek, P. Höfner, A. Mciver, M. Portmann et al., Automated Analysis of AODV Using UPPAAL, Lecture Notes in Computer Science, vol.7214, pp.173-187, 2012.
DOI : 10.1007/978-3-642-28756-5_13

P. Höfner, R. J. Van-glabbeek, W. L. Tan, M. Portmann, A. Mciver et al., A rigorous analysis of AODV and its variants, MSWiM, pp.203-212, 2012.

K. S. Namjoshi and R. J. Trefler, Analysis of Dynamic Process Networks, TACAS 2015, 2015.
DOI : 10.1007/978-3-662-46681-0_11

S. S. Owicki and D. Gries, Verifying properties of parallel programs: an axiomatic approach, Communications of the ACM, vol.19, issue.5, pp.279-285, 1976.
DOI : 10.1145/360051.360224

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 1977.
DOI : 10.1109/SFCS.1977.32

A. Pnueli, In Transition From Global to Modular Temporal Reasoning about Programs, Logics and Models of Concurrent Systems, NATO ASI Series, 1985.
DOI : 10.1007/978-3-642-82453-1_5

M. Saksena, O. Wibling, and B. Jonsson, Graph grammar modelling and verification of ad hoc routing protocols, Theory and Practice of Software: TACAS 08, pp.18-32, 2008.

R. J. Van-glabbeek, P. Höfner, W. L. Tan, and M. Portmann, Sequence numbers do not guarantee loop freedom ? AODV can yield routing loops ?, MSWiM, p.10, 2013.