P. A. Abdulla and B. Jonsson, Verifying Programs with Unreliable Channels, Information and Computation, vol.127, issue.2, pp.91-101, 1996.
DOI : 10.1006/inco.1996.0053

A. Cheng, J. Esparza, and J. Palsberg, Complexity results for 1-safe nets, Theoretical Computer Science, vol.147, issue.1-2, pp.117-136, 1995.
DOI : 10.1016/0304-3975(94)00231-7
URL : http://doi.org/10.1016/0304-3975(94)00231-7

G. Delzanno, A. Sangnier, and G. Zavattaro, Parameterized Verification of Ad Hoc Networks, pp.313-327
DOI : 10.1007/978-3-642-15375-4_22

G. Delzanno, A. Sangnier, and G. Zavattaro, On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks, pp.441-455
DOI : 10.1007/978-3-642-19805-2_30

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

C. Ene and T. Muntean, A broadcast-based calculus for communicating systems, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, p.149
DOI : 10.1109/IPDPS.2001.925136

J. Esparza, A. Finkel, and R. Mayr, On the verification of broadcast protocols, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.352-359
DOI : 10.1109/LICS.1999.782630

A. Fehnker, L. Van-hoesel, and A. Mader, Modelling and verification of the LMAC protocol for wireless sensor networks. IFM'07, pp.253-272

J. C. Godskesen, A calculus for Mobile Ad Hoc Networks. COORDINA- TION'07, pp.132-150

S. Joshi and B. König, Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems, pp.214-226
DOI : 10.1007/978-3-540-70545-1_21

R. E. Ladner, The circuit value problem is logspace complete for P. SIGACT News, pp.18-20, 1977.

R. J. Lipton, The Reachability Problem Requires Exponential Space, 1976.

M. Merro, An Observational Theory for Mobile Ad Hoc Networks, Electronic Notes in Theoretical Computer Science, vol.173, issue.2, pp.194-208, 2009.
DOI : 10.1016/j.entcs.2007.02.039

M. Merro, F. Ballardin, and E. Sibilio, A timed calculus for wireless systems, Theoretical Computer Science, vol.412, issue.47, pp.6585-6611, 2011.
DOI : 10.1016/j.tcs.2011.07.016

I. Lanese and D. Sangiorgi, An operational semantics for a calculus for wireless systems, Theoretical Computer Science, vol.411, issue.19, pp.411-1928, 2010.
DOI : 10.1016/j.tcs.2010.01.023

S. Nanz and C. Hankin, A framework for security analysis of mobile wireless networks, Theoretical Computer Science, vol.367, issue.1-2, pp.203-227, 2006.
DOI : 10.1016/j.tcs.2006.08.036

K. V. Prasad, A Calculus of Broadcasting Systems, pp.285-327, 1995.

A. Singh, C. R. Ramakrishnan, and S. A. Smolka, A process calculus for Mobile Ad Hoc Networks, pp.296-314

A. Singh, C. R. Ramakrishnan, and S. A. Smolka, Query-Based Model Checking of Ad??Hoc??Network??Protocols, pp.603-619
DOI : 10.1145/1101908.1101915

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978.
DOI : 10.1016/0304-3975(78)90036-1