A process calculus for mobile ad hoc networks

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

Volumn 5052 LNCS, Issue , 2008, Pages 296-314

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

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTER NETWORKS; CONTROL SYSTEMS; DIFFERENTIATION (CALCULUS); DISTRIBUTED COMPUTER SYSTEMS; FUNCTIONS; INFORMATION THEORY; LINGUISTICS; METROPOLITAN AREA NETWORKS; MOBILE TELECOMMUNICATION SYSTEMS; MODAL ANALYSIS; NETWORK PROTOCOLS; SEPARATION; SURFACE CHEMISTRY; TELECOMMUNICATION NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

(E ,3E) PROCESS; BISIMULATION; COORDINATION MODELS; FORMAL MODELING; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; KEY FEATURE; LABELED TRANSITION SYSTEMS (LTS); LANGUAGES (TRADITIONAL); MOBILE AD HOC WIRELESS NETWORK (MANET); MOBILE AD-HOC NETWORK (MANET); NODE MOVEMENTS; OPERATIONAL SEMANTICS; PROCESS CALCULUS; SPRINGER (CO); STATE REACHABILITY; TRANSMISSION RANGES; TWO TYPES;

AD HOC NETWORKS;

EID: 45749140094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68265-3_19     Document Type: Conference Paper

References (21)

1. Basu, S., Ramakrishnan, C.R.: Compositional analysis for verification of parameterized systems. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 315-330. Springer, Heidelberg (2003)
2. Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378. Springer, Heidelberg (1998)
3. Dam, M.: On the decidability of process equivalences for the Π-calculus. Theoretical Computer Science 183, 215-228 (1997)
4. Ene, C., Muntean, T.: A broadcast-based calculus for communicating systems. In: Intl. Workshop on Formal Methods for Parallel Programming: Theory and Applications (2001)
5. Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 132-150. Springer, Heidelberg (2007)
6. Godskesen, J.C., Gryn, O.: Modelling and verification of security protocols for ad hoc networks using UPPAAL. In: Proc. 18th Nordic Workshop on Programming Theory (October 2006)
7. Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. In: High-Level Concurrent Languages. Electr. Notes Theor. Comput. Sci., vol. 16.3, pp. 3-17 (1998)
8. Merro, M.: An observational theory for mobile ad hoc networks. In: Proc. MFPS 2007. Electr. Notes Theor. Comput. Sci., vol. 173, pp. 275-293. Elsevier, Amsterdam (2007)
9. Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. In: Proc. MFPS 2006. Electr. Notes Theor. Comput. Sci., vol. 158, pp. 331-354. Elsevier, Amsterdam (2006)
10. Milner, R.: The polyadic pi-calculus: a tutorial. In: Logic and Algebra of Specification, pp. 203-246. Springer, Heidelberg (1993)
11. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I and II. Information and Computation 100(1), 1-77 (1992)
12. Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theoretical Computer Science 367(1-2), 203-227 (2006)
13. Ostrovsky, K., Prasad, K.V.S., Taha, W.: Towards a primitive higher order calculus of broadcasting systems. In: PPDP, pp. 2-13. ACM, New York (2002)
14. Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2-3), 285-327 (1995)
15. Ramakrishna, Y.S., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A., Swift, T., Warren, D.S.: Efficient model checking using tabled resolution. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 143-154. Springer, Heidelberg (1997)
16. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks (2008), http://www.lmc.cs.sunysb.edu/∼anusingh/omega/
17. Vasudevan, S., Kurose, J.F., Towsley, D.F.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: ICNP, pp. 350-360. IEEE Computer Society, Los Alamitos (2004)
18. XSB. The XSB logic programming system, http://xsb.sourceforge.net
19. Yang, P., Basu, S., Ramakrishnan, C.R.: Parameterized verification of pi-calculus systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 42-57. Springer, Heidelberg (2006)
20. Yang, P., Dong, Y., Ramakrishnan, C.R., Smolka, S.A.: A provably correct compiler for efficient model checking of mobile processes. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol. 3350, pp. 113-127. Springer, Heidelberg (2005)
21. Yang, P., Ramakrishnan, C.R., Smolka, S.A.: A logical encoding of the pi-calculus: Model checking mobile processes using tabled resolution. International Journal on Software Tools for Technology Transfer (STTT) 6(1), 38-66 (2004)