A process calculus for Mobile Ad Hoc Networks

Science of Computer Programming

Volumn 75, Issue 6, 2010, Pages 440-469

  Singh, Anu ^a   Ramakrishnan, C R ^a   Smolka, Scott A ^a  

^a Stony Brook University   (United States)

Author keywords

Bisimulation; Congruence; Mobile Ad Hoc Networks; Process calculi

Indexed keywords

AODV ROUTING PROTOCOL; BISIMULATION; BISIMULATION CONGRUENCES; BISIMULATION EQUIVALENCES; CONSERVATIVE EXTENSIONS; ESSENTIAL CHARACTERISTIC; FORMAL MODEL; KEY FEATURE; LABELED TRANSITION SYSTEMS; LEADER ELECTION; MOBILE AD HOC WIRELESS NETWORKS; NODE MOVEMENT; OPERATIONAL SEMANTICS; PROCESS CALCULI; STATE REACHABILITY; SYMBOLIC BISIMULATION; SYMBOLIC SEMANTICS; TRANSMISSION RANGES;

BROADCASTING; CALCULATIONS; DISTRIBUTED COMPUTER SYSTEMS; MOBILE AD HOC NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PATHOLOGY; SEMANTICS; SURFACE CHEMISTRY;

AD HOC NETWORKS;

EID: 77949773794     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2009.07.008     Document Type: Article

References (24)

1. Basu S., and Ramakrishnan C.R. Compositional analysis for verification of parameterized systems. TACAS. LNCS vol. 2619 (2003), Springer 315-330
2. Bruni R., and Lanese I. Parametric synchronizations in mobile nominal calculi. Theoret. Comput. Sci. 402 2-3 (2008) 102-119
3. Cardelli L., and Gordon A.D. Mobile ambients. FOSSACS (1998), Springer-Verlag
4. Dam M. On the decidability of process equivalences for the π-calculus. Theoret. Comput. Sci. 183 (1997) 215-228
5. Ene C., and Muntean T. A broadcast-based calculus for communicating systems. IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium (2001), IEEE Computer Society, Washington, DC, USA 149
6. Godskesen J.C. A calculus for mobile ad hoc networks. COORDINATION. Lecture Notes in Computer Science vol. 4467 (2007), Springer 132-150
7. J.C. Godskesen, O. Gryn, Modelling and verification of security protocols for ad hoc networks using UPPAAL, in: Proc. 18th Nordic Workshop on Programming Theory, October 2006
8. Hennessy M., and Riely J. Resource access control in systems of mobile agents. High-Level Concurrent Languages. Electr. Notes Theor. Comput. Sci. vol. 16.3 (1998) 3-17
9. Merro M. An observational theory for mobile ad hoc networks. Proc. MFPS '07. Electr. Notes Theor. Comput. Sci. vol. 173 (2007), Elsevier 275-293
10. Mezzetti N., and Sangiorgi D. Towards a calculus for wireless systems. Proc. MFPS '06. Electr. Notes Theor. Comput. Sci. vol. 158 (2006), Elsevier 331-354
11. Milner R. The polyadic pi-calculus: A tutorial. Logic and Algebra of Specification (1993), Springer-Verlag 203-246
12. Milner R., Parrow J., and Walker D. A calculus of mobile processes, Parts I and II. Inform. Comput. 100 1 (1992) 1-77
13. Nanz S., and Hankin C. A framework for security analysis of mobile wireless networks. Theoret. Comput. Sci. 367 1-2 (2006) 203-227
14. Ostrovsky K., Prasad K.V.S., and Taha W. Towards a primitive higher order calculus of broadcasting systems. PPDP (2002), ACM 2-13
15. Parrow J. An introduction to the pi-calculus. In: Bergstra J.A., Ponse A., and Smolka S.A. (Eds). Handbook of Process Algebra (2001), Elsevier 479-543
16. C.E. Perkins, E.M. Belding-Royer, S.R. Das, Ad hoc on-demand distance vector routing protocol, Internet-draft, IETF MANET Working Group, 2003. Available at http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-13.txt
17. Prasad K.V.S. A calculus of broadcasting systems. Sci. Comput. Program. 25 2-3 (1995) 285-327
18. Ramakrishna Y.S., Ramakrishnan C.R., Ramakrishnan I.V., Smolka S.A., Swift T., and Warren D.S. Efficient model checking using tabled resolution. CAV. LNCS vol. 1254 (1997), Springer 143-154
19. Sangiorgi D. On the bisimulation proof method. Math. Struct. Comput. Sci. 8 5 (1998) 447-479
20. Vasudevan S., Kurose J.F., and Towsley D.F. Design and analysis of a leader election algorithm for mobile ad hoc networks. ICNP (2004), IEEE Computer Society 350-360
21. XSB. The XSB logic programming system. http://xsb.sourceforge.net
22. Yang P., Basu S., and Ramakrishnan C.R. Parameterized verification of pi-calculus systems. TACAS. LNCS vol. 3920 (2006), Springer 42-57
23. Yang P., Dong Y., Ramakrishnan C.R., and Smolka S.A. A provably correct compiler for efficient model checking of mobile processes. PADL. LNCS vol. 3350 (2005), Springer 113-127
24. Yang P., Ramakrishnan C.R., and Smolka S.A. A logical encoding of the pi-calculus: Model checking mobile processes using tabled resolution. Int. J. Softw. Tools Technol. Transfer (STTT) 6 1 (2004) 38-66