Advertisement

Broadcast Psi-calculi with an Application to Wireless Protocols

  • Johannes Borgström
  • Shuqin Huang
  • Magnus Johansson
  • Palle Raabjerg
  • Björn Victor
  • Johannes Åman Pohjola
  • Joachim Parrow
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7041)

Abstract

Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication in order to model wireless protocols. The additions preserve the purity of the psi-calculi semantics, and we formally prove the standard congruence and structural properties of bisimilarity. We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.

Keywords

Node Mobility Broadcast Channel Route Request RREQ Message Process Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104–115. ACM, New York (2001)Google Scholar
  2. 2.
    Austry, D., Boudol, G.: Algèbre de processus et synchronisation. Theor. Comput. Sci. 30, 91–131 (1984)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: Mobile processes, nominal data, and logic. In: Proceedings of LICS 2009, pp. 39–48. IEEE, Los Alamitos (2009)Google Scholar
  4. 4.
    Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: A framework for mobile processes with nominal data and logic. Logical Methods in Computer Science (2011), Accepted for publication. This is an extended version of [3]Google Scholar
  5. 5.
    Ene, C., Muntean, T.: Expressiveness of point-to-point versus broadcast communications. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 258–268. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  6. 6.
    Gabbay, M., Pitts, A.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341–363 (2001)CrossRefzbMATHGoogle Scholar
  7. 7.
    Ghassemi, F., Fokkink, W., Movaghar, A.: Restricted broadcast process theory. In: Cerone, A., Gruner, S. (eds.) SEFM, pp. 345–354. IEEE Computer Society, Los Alamitos (2008)Google Scholar
  8. 8.
    Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Murphy, A.L., Ryan, M. (eds.) COORDINATION 2007. LNCS, vol. 4467, pp. 132–150. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Godskesen, J.C.: Observables for mobile and wireless broadcasting systems. In: Clarke, D., Agha, G. (eds.) COORDINATION 2010. LNCS, vol. 6116, pp. 1–15. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Johansson, M., Victor, B., Parrow, J.: A fully abstract symbolic semantics for psi-calculi. In: Proceedings of SOS 2009. EPTCS, vol. 18, pp. 17–31 (2010)Google Scholar
  11. 11.
    Johansson, M., Victor, B., Parrow, J.: Computing strong and weak bisimulations for psi-calculi (submitted for publication, 2011)Google Scholar
  12. 12.
    Lanese, I., Sangiorgi, D.: An operational semantics for a calculus for wireless systems. Theor. Comp. Sci. 411(19), 1928–1948 (2010)CrossRefzbMATHGoogle Scholar
  13. 13.
    Merro, M.: An observational theory for mobile ad hoc networks (full version). Inf. Comput. 207(2), 194–208 (2009)CrossRefzbMATHGoogle Scholar
  14. 14.
    Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. Electr. Notes Theor. Comput. Sci. 158, 331–353 (2006)CrossRefzbMATHGoogle Scholar
  15. 15.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)CrossRefzbMATHGoogle Scholar
  16. 16.
    Milner, R.: Calculi for synchrony and asynchrony. Theor. Comput. Sci. 25, 267–310 (1983)CrossRefzbMATHGoogle Scholar
  17. 17.
    Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comp. Sci. 367(1-2), 203–227 (2006)CrossRefzbMATHGoogle Scholar
  18. 18.
    Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 186, 165–193 (2003)CrossRefzbMATHGoogle Scholar
  19. 19.
    Prasad, K.V.S.: A calculus of broadcasting systems. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 338–358. Springer, Heidelberg (1991)Google Scholar
  20. 20.
    Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2-3), 285–327 (1995)CrossRefGoogle Scholar
  21. 21.
    Raabjerg, P., Åman Pohjola, J.: Broadcast psi-calculus formalisation. Isabelle/HOL-Nominal formalisation of the definitions, theorems and proofs (July 2011), http://www.it.uu.se/research/group/mobility/theorem/broadcastpsi
  22. 22.
    Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar
  23. 23.
    Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program. 75(6), 440–469 (2010)CrossRefzbMATHGoogle Scholar
  24. 24.
    Tschudin, C., Gold, R., Rensfelt, O., Wibling, O.: LUNAR: a lightweight underlay network ad-hoc routing protocol and implementation. In: Proc. of NEW2AN 2004, St. Petersburg (February 2004)Google Scholar
  25. 25.
    Tschudin, C.F.: Lightweight underlay network ad hoc routing (LUNAR) protocol. Internet Draft, Mobile Ad Hoc Networking Working Group (March 2004)Google Scholar
  26. 26.
    Urban, C., Tasson, C.: Nominal techniques in isabelle/HOL. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 38–53. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  27. 27.
    Wibling, O.: SPIN and UPPAAL ad hoc routing protocol models. Models of LUNAR scenarios used in [28] (2004), http://www.it.uu.se/research/group/mobility/adhoc/gbt/other_examples
  28. 28.
    Wibling, O., Parrow, J., Pears, A.: Automatized verification of ad hoc routing protocols. In: de Frutos-Escrig, D., Núñez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 343–358. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Johannes Borgström
    • 1
  • Shuqin Huang
    • 2
  • Magnus Johansson
    • 1
  • Palle Raabjerg
    • 1
  • Björn Victor
    • 1
  • Johannes Åman Pohjola
    • 1
  • Joachim Parrow
    • 1
  1. 1.Department of Information TechnologyUppsala UniversitySweden
  2. 2.Peking UniversityChina

Personalised recommendations