Verification of directed acyclic ad hoc networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7892 LNCS, Issue , 2013, Pages 193-208

  Abdulla, Parosh Aziz ^a   Atig, Mohamed Faouzi ^a   Rezine, Othmane ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC NETWORKS; ADJACENT VERTICES; COMMUNICATION PATTERN; CONNECTIVITY GRAPH; DECISION PROBLEMS; DIRECTED ACYCLIC GRAPH (DAG); PARAMETERIZED VERIFICATIONS; UNDERLYING NETWORKS;

AD HOC NETWORKS; COMPUTABILITY AND DECIDABILITY;

GRAPH THEORY;

EID: 84884994354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38592-6_14     Document Type: Conference Paper

References (13)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321. IEEE Computer Society (1996)
2. 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)
3. 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)
4. 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)
5. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2(7), 326-336 (1952)
6. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Netw. 11(1), 2-16 (2003)
7. Levis, P., Patel, N., Culler, D.E., Shenker, S.: Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In: NSDI, pp. 15-28 (2004)
8. Merro, M., Ballardin, F., Sibilio, E.: A timed calculus for wireless systems. Theor. Comput. Sci. 412(47), 6585-6611 (2011)
9. Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1-2), 203-227 (2006)
10. Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2-3), 285-327 (1995)
11. Saksena, M., Wibling, O., Jonsson, B.: Graph Grammar Modeling and Verification of Ad HocRouting Protocols. In:Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 18-32. Springer, Heidelberg (2008)
12. 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)
13. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program. 75(6), 440-469 (2010)