An Observational Theory for Mobile Ad Hoc Networks (full version)

Information and Computation

Volumn 207, Issue 2, 2009, Pages 194-208

  Merro, Massimo ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

Ad hoc network; Bisimulation; Labelled Transition Semantics; Process calculus

Indexed keywords

AD HOC NETWORKS; CALCULATIONS; SEMANTICS;

BISIMULATIONS; LABELLED TRANSITION SEMANTICS; LABELLED TRANSITION SYSTEMS; LABELLED TRANSITIONS; OPERATIONAL SEMANTICS; PROCESS CALCULI; PROGRAM EQUIVALENCE; REDUCTION SEMANTICS;

MOBILE AD HOC NETWORKS;

EID: 77949435116     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.11.010     Document Type: Conference Paper

References (26)

1. G. Berry, G. Gonthier, The esterel synchronous programming language: design, semantics, implementation, Science of Computer Programming, 19 (2) (1992) 87-152. (Pubitemid 23582985)
2. C. Ene, T. Muntean, A broadcast based calculus for communicating systems, in: IPDPS, IEEE Computer Society, 2001, pp. 149-159.
3. A. Francalanza, M. Hennessy, A theory of system behaviour in the presence of node and link failures, in: CONCUR, volume 3653 of Lecture Notes in Computer Science, Springer, 2005, pp. 368-382. (Pubitemid 41520753)
4. A. Francalanza, M. Hennessy, A theory for observational fault tolerance, in: FoSSaCS, volume 3921 of Lecture Notes in Computer Science, Springer, 2006, pp. 16-31. (Pubitemid 44019329)
5. J.C. Godskesen, A calculus for mobile ad hoc networks, in: COORDINATION, volume 4467 of Lecture Notes in Computer Science, Springer Verlag, 2007, pp. 132-150. (Pubitemid 350259724)
6. D. Harel, Statecharts: a visual formulation for complex systems, Science of Computer Programming 8 (3) (1987) 231-274. (Pubitemid 17617706)
7. M. Hennessy, J. Rathke, Bisimulations for a calculus of broadcasting systems, Theoretical Computer Science 200 (1998) 225-260. (Pubitemid 128450818)
8. K. Honda, N. Yoshida, On reduction-based process semantics, Theoretical Computer Science 152 (2) (1995) 437-486.
9. M. Merro, An observational theory for mobile ad hoc networks, Electronic Notes in Theoretical Computer Science 173 (2007) 275-293. (Pubitemid 46367806)
10. N. Mezzetti, D. Sangiorgi, Towards a calculus for wireless systems, Electronic Notes in Theoretical Computer Science 158 (2006) 331-353.
11. R. Milner, Calculi for synchrony and asynchrony, Theoretical Computer Science 25 (1983) 267-310.
12. R. Milner, Communication and Concurrency, Prentice Hall, 1989.
13. R. Milner, J. Parrow, D.Walker, A calculus of mobile processes (parts I and II), Information and Computation 100 (1992) 1-77.
14. R. Milner, D. Sangiorgi, Barbed bisimulation, in: ICALP, volume 623 of Lecture Notes in Computer Science, Springer Verlag, 1992, pp. 685-695.
15. S. Nanz, C. Hankin, A framework for security analysis of mobile wireless networks, Theoretical Computer Science 367 (1-2) (2006) 203-227. (Pubitemid 44648581)
16. K. Ostrovsky, K.V.S. Prasad,W. Taha, Towards a primitive higher order calculus of broadcasting systems, in: PPDP, ACM, 2002, pp. 2-13.
17. C.E. Perkins, E.M. Belding-Royer, Ad-hoc on-demand distance vector routing, in: WMCSA, IEEE Computer Society, 1999, pp. 90-100.
18. G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.
19. K.V.S. Prasad, A calculus of value broadcasts, in: PARLE, volume 694 of Lecture Notes in Computer Science, Springer Verlag, 1993, pp. 391-402.
20. K.V.S. Prasad, A calculus of broadcasting systems, Science of Computer Programming 25 (2-3) (1995).
21. K.V.S. Prasad, Broadcasting in time, in: COORDINATION, volume 1061 of Lecture Notes in Computer Science, Springer Verlag, 1996, pp. 321-338. (Pubitemid 126063067)
22. K.V.S. Prasad, A prospectus for mobile broadcasting systems, in: Workshop on Algebraic Process Calculi: The First Twenty-Five Years and Beyond (PA'05). BRICS Press, 2005.
23. T. Rappaport, Monographs in Computer Science, second ed., Prentice Hall, 2002.
24. D. Sangiorgi, D.Walker, The -Calculus: A Theory of Mobile Processes, Cambridge University Press, 2001.
25. K. Sanzgir, D. LaFlamme, B. Dahil, B. Neil Levine, C. Shields, E.M. Belding-Royer, Authenticated routing for ad hoc networks, IEEE Journal on Selected Areas in Communication, special issue on Wireless Ad Hoc Networks 23 (3) (2005) 598-610.
26. A. Singh, C.R. Ramakrishnan, S.A. Smolka, A Process Calculus for Mobile Ad Hoc Networks, 2006. Available from: http://www.lmc.cs.sunysb.edu/cram/Papers/ SRSOmegaCalc2006/urlhttp://www.lmc.cs.sunysb.edu/cram/Papers/SRSOmegaCalc2006/.