References

  1. P. A. Abdulla, C. Čer\=ans, B. Jonsson & Y.-K. Tsay (1996): General decidability theorems for infinite-state systems. In: LICS'96. IEEE Computer Society, pp. 313–321.
  2. P. A. Abdulla, C. Čer\=ans, B. Jonsson & Tsay. Y.-K. (2000): Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), pp. 109–127.
  3. G. Delzanno, A. Sangnier & G. Zavattaro (2010): Parameterized Verification of Ad Hoc Networks. In: CONCUR'10, Lecture Notes in Computer Science 6269. Springer, pp. 313–327, doi:10.1007/978-3-642-15375-4_22.
  4. G. Delzanno, A. Sangnier & G. Zavattaro (2011): On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. In: FOSSACS'11, Lecture Notes in Computer Science 6604. Springer, pp. 441–455, doi:10.1007/978-3-642-19805-2_30.
  5. G. Ding (1992): Subgraphs and well quasi ordering. J. of Graph Theory 16(5), pp. 489 – 502.
  6. E. A. Emerson & K. S. Namjoshi (1998): On Model Checking for Non-Deterministic Infinite-State Systems. In: LICS'98. IEEE Computer Society, pp. 70–80.
  7. C. Ene & T. Muntean (2001): A Broadcast based Calculus for Communicating Systems. In: IPDPS '01, pp. 149.
  8. J. Esparza, A. Finkel & R. Mayr (1999): On the Verification of Broadcast Protocols. In: LICS'99. IEEE Computer Society, pp. 352–359.
  9. A. Fehnker, L. van Hoesel & A. Mader (2007): Modelling and verification of the LMAC protocol for wireless sensor networks. In: IFM'07, Lecture Notes in Computer Science 4591. Springer, pp. 253–272, doi:10.1007/978-3-540-73210-5_14.
  10. Y. Fernandess & D. Malkhi (2002): K-clustering in wireless ad hoc networks. In: POMC'02. ACM, pp. 31–37, doi:10.1145/584490.584497.
  11. A. Finkel & P. Schnoebelen (2001): Well-structured transition systems everywhere!. Theoretical Computer Science 256(1-2), pp. 63–92, doi:10.1016/S0304-3975(00)00102-X.
  12. J.C. Godskesen (2007): A Calculus for Mobile Ad Hoc Networks. In: COORDINATION '07, pp. 132–150.
  13. A.J. Hoffman & R.R. Singleton (1960): On Moore graphs with diameter 2 and 3. IBM J. Res. Develop. 4, pp. 497–504, doi:10.1147/rd.45.0497.
  14. Ivan Lanese & Davide Sangiorgi (2010): An operational semantics for a calculus for wireless systems. Theoretical Computer Science 411(19), pp. 1928–1948, doi:10.1016/j.tcs.2010.01.023.
  15. M. Merro (2009): An Observational Theory for Mobile Ad Hoc Network. Inf. Comput. 207(2), pp. 194–208, doi:10.1016/j.ic.2007.11.010.
  16. R. Meyer (2008): On boundedness in depth in the pi-calculus. In: IFIP TCS'08, IFIP 477–489. Springer, pp. 477–489.
  17. S. Nanz & C. Hankin (2006): A Framework for Security Analysis of Mobile Wireless Networks. TCS 367(1–2), pp. 203–227, doi:10.1016/j.tcs.2006.08.036.
  18. K.V.S. Prasad (1995): A Calculus of Broadcasting Systems. Sci. of Comp. Prog. 25(2-3), pp. 285–327, doi:10.1016/0167-6423(95)00017-8.
  19. Milner R. (1999): Communicating and Mobile Systems: the Pi-Calculus. Cambridge Univ. Press.
  20. M. Saksena, O. Wibling & B. Jonsson (2008): Graph grammar modeling and verification of Ad Hoc Routing Protocols. In: TACAS'08, Lecture Notes in Computer Science 4963. Springer, pp. 18–32, doi:10.1007/978-3-540-78800-3_3.
  21. P. Schnoebelen (2010): Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: MFCS'10, Lecture Notes in Computer Science 6281. Springer, pp. 616–628, doi:10.1007/978-3-642-15155-2_54.
  22. A. Singh, C. R. Ramakrishnan & S. A. Smolka (2006): Modeling the AODV routing protocol in omega-calculus. In: LISAT '06.
  23. A. Singh, C. R. Ramakrishnan & S. A. Smolka (2008): A Process Calculus for Mobile Ad Hoc Networks. In: Springer: COORDINATION '08, Lecture Notes in Computer Science 5052, pp. 296–314.
  24. A. Singh, C. R. Ramakrishnan & S. A. Smolka (2009): Query-Based model checking of Ad Hoc Network Protocols. In: CONCUR'09, Lecture Notes in Computer Science 5710. Springer, pp. 603–61.
  25. T. Wies, D Zufferey & T. A. Henzinger (2010): Forward analysis of depth-bounded processes. In: FOSSACS'10, Lecture Notes in Computer Science 6014. Springer, pp. 94–108, doi:10.1007/978-3-642-12032-9_8.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org