Advertisement

Software & Systems Modeling

, Volume 14, Issue 1, pp 201–216 | Cite as

Broadcast psi-calculi with an application to wireless protocols

  • Johannes Borgström
  • Shuqin Huang
  • Magnus Johansson
  • Palle Raabjerg
  • Björn VictorEmail author
  • Johannes Åman Pohjola
  • Joachim Parrow
Special Section Paper

Abstract

Psi-calculi is a parametric framework for the extensions of 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

Psi-calculus Broadcast communication Bisimulation Ad hoc routing protocol 

References

  1. 1.
    Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL ’01, pp. 104–115. ACM (2001)Google Scholar
  2. 2.
    Austry, D., Boudol, G.: Algèbre de processus et synchronisation. Theor. Comput. Sci. 30, 91–131 (1984)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bengtson, J.: Formalising process calculi. PhD thesis, Uppsala University (2010)Google Scholar
  4. 4.
    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 (2009)Google Scholar
  5. 5.
    Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods Comput. Sci. 7(1) (2011)Google Scholar
  6. 6.
    Borgström, J., Huang, S., Johansson, M., Raabjerg, P., Victor, B., Åman Pohjola, J., Parrow, J.: Broadcast psi-calculi with an application to wireless protocols. In: Barthe, G., Pardo, A., Schneider, G. (eds.) Software Engineering and Formal Methods: SEFM 2011, vol. 7041 of Lecture Notes in Computer Science, pp. 74–89. Springer (2011)Google Scholar
  7. 7.
    Ene, C., Traian, M.: Expressiveness of point-to-point versus broadcast communications. In: Ciobanu, G., Paun, G. (eds.) Proceedings of FCT, vol. 1684 of Lecture Notes in Computer Science, pp. 258–268. Springer (1999)Google Scholar
  8. 8.
    Gabbay, M., Pitts, A.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13, 341–363 (2001)CrossRefGoogle Scholar
  9. 9.
    Ghassemi, F., Fokkink, W., Movaghar, A.: Restricted broadcast process theory. In: Cerone, A., Gruner, S. (eds.) Proceedings of SEFM 2008, pp. 345–354. IEEE Computer Society (2008)Google Scholar
  10. 10.
    Godskesen, J.C.: A calculus for mobile ad hoc networks. In: Murphy, A.L., Vitek, J. (eds.) Proceedings of COORDINATION 2007, vol. 4467 of Lecture Notes in Computer Science, pp. 132–150. Springer (2007)Google Scholar
  11. 11.
    Godskesen, J.C.: Observables for mobile and wireless broadcasting systems. In: Proceedings of COORDINATION 2010, vol. 6116 of Lecture Notes in Computer Science, pp. 1–15. Springer (2010)Google Scholar
  12. 12.
    Godskesen, J.C., Nanz, S.: Mobility models and behavioural equivalence for wireless networks. In: Field, J., Vasconcelos, V.T. (eds.) Proceedings of Coordination Models and Languages, number 5521 in Lecture Notes in Computer Science, pp. 106–122. Springer (2009)Google Scholar
  13. 13.
    Gutkovas, R.: Exercising psi-calculi: a psi-calculi workbench. M. Sc. thesis, Department of Information Technology, Uppsala University, June (2011)Google Scholar
  14. 14.
    Johansson, M.: Psi-calculi: a framework for mobile process calculi. PhD thesis, Uppsala University, May (2010)Google Scholar
  15. 15.
    Johansson, M., Victor, B., Parrow, J.: Computing strong and weak bisimulations for psi-calculi. J. Logic Algeb. Program. 81(3), 162–180 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    Lanese, I., Sangiorgi, D.: An operational semantics for a calculus for wireless systems. Theor. Comput. Sci. 411(19), 1928–1948 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Merro, M.: An observational theory for mobile ad hoc networks (full version). J. Inf. Comput. 207(2), 194–208 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. Electron. Notes Theor. Comput. Sci. 158, 331–353 (2006)CrossRefGoogle Scholar
  19. 19.
    Milner, R.: A calculus of communicating systems, vol. 92 of Lecture Notes in Computer Science. Springer (1980)Google Scholar
  20. 20.
    Milner, R.: Calculi for synchrony and asynchrony. Theor. Comput. Sci. 25, 267–310 (1983)CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I/II. J. Inf. Comput. 100, 1–77 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1–2), 203–227 (2006)Google Scholar
  23. 23.
    Parrow, J., Borgström, J., Raabjerg, P., Åman Pohjola, J.: Higher-order psi-calculi. In: Mathematical Structures in Computer Science, FirstView, June (2013)Google Scholar
  24. 24.
    Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186, 165–193 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  25. 25.
    Åman Pohjola, J.: Higher-order broadcast psi-calculus formalisation. http://www.it.uu.se/research/group/mobility/theorem/higherorderbroadcast.tar.gz, July (2013)
  26. 26.
    Prasad, K.V.S.: A calculus of broadcasting systems. In: Abramsky, S., Maibaum, T.S.E. (eds.) TAPSOFT, vol. 1, volume 493 of Lecture Notes in Computer Science, pp. 338–358. Springer (1991)Google Scholar
  27. 27.
    Prasad, K.V.S.: A calculus of broadcasting systems. Sci. Comput. Program. 25(2–3), 285–327 (1995)CrossRefGoogle Scholar
  28. 28.
    Raabjerg, P., Åman Pohjola, J.: Broadcast psi-calculus formalisation. http://www.it.uu.se/research/group/mobility/theorem/broadcastpsi, July (2011)
  29. 29.
    Sangiorgi, D.: On the bisimulation proof method. Math. Struct. Comput. Sci. 8(5), 447–479 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  30. 30.
    Sangiorgi, D., Walker, D.: The \(\pi \)-Calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar
  31. 31.
    Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program. 75(6), 440–469 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  32. 32.
    Tschudin, C.F.: Lightweight underlay network ad hoc routing (LUNAR) protocol. Internet Draft, Mobile Ad Hoc Networking Working Group, March (2004)Google Scholar
  33. 33.
    Tschudin, C., Gold, R., Rensfelt, O., Wibling, O.: LUNAR: a lightweight underlay network ad-hoc routing protocol and implementation. In: Proceedings of NEW2AN’04, St. Petersburg, February (2004)Google Scholar
  34. 34.
    Urban, C., Tasson, C.: Nominal techniques in Isabelle/HOL. In: Nieuwenhuis, R. (ed.) Proceedings of CADE 2005, vol. 3632 of Lecture Notes in Computer Science, pp. 38–53. Springer (2005)Google Scholar
  35. 35.
    Wibling, O.: SPIN0 and UPPAAL ad hoc routing protocol models. http://www.it.uu.se/research/group/mobility/adhoc/gbt/other_examples (2004)
  36. 36.
    Wibling, O., Parrow, J., Pears, A.: Automatized verification of ad hoc routing protocols. In: Núñez, D.F.E.M. (eds.) Formal Techniques for Networked and Distributed Systems (FORTE 2004), vol. 3235 of Lecture Notes in Computer Science, pp. 343–358. Springer (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

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

Personalised recommendations