Skip to main content
Springer Nature Link
Log in

A Timed Calculus for Wireless Systems

  • Conference paper
Fundamentals of Software Engineering (FSEN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5961))

Included in the following conference series:

  • 508 Accesses

Abstract

We propose a timed process calculus for wireless systems, paying attention in modelling communication collisions. The operational semantics of our calculus is given in terms of a labelled transition system. The calculus enjoys a number of desirable time properties such as (i) time determinism: the passage of time is deterministic; (ii) patience: devices will wait indefinitely until they can communicate; (iii) maximal progress: data transmissions cannot be delayed, they must occur as soon as a possibility for communication arises.

The main behavioural equality of our calculus is a timed variant of barbed congruence, a standard branching-time and contextually-defined program equivalence. As an efficient proof method for timed barbed congruence we define a labelled bisimilarity. We then apply our bisimulation proof-technique to prove a number of algebraic properties.

This work was partially supported by the PRIN 2007 project “SOFT”.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. IEEE 802.11 WG: ANSI/IEEE standard 802.11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

  2. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  3. Bergstra, J., Klop, J.: Process algebra for synchronous communication. Information and Computation 60, 109–137 (1984)

    MATH  MathSciNet  Google Scholar 

  4. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (Parts I and II). Information and Computation 100, 1–77 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cardelli, L., Gordon, A.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hennessy, M., Riely, J.: A typed language for distributed mobile processes. In: 25th POPL. ACM Press, New York (1998)

    Google Scholar 

  7. Mezzetti, N., Sangiorgi, D.: Towards a Calculus For Wireless Systems. Electronic Notes in Theoretical Computer Science 158, 331–353 (2006)

    Article  Google Scholar 

  8. Nanz, S., Hankin, C.: A Framework for Security Analysis of Mobile Wireless Networks. Theoretical Computer Science 367(1-2), 203–227 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A Process Calculus for Mobile Ad Hoc Networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol. 5052, pp. 296–314. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Merro, M.: An Observational Theory for Mobile Ad Hoc Networks (full paper). Information and Computation 207(2), 194–208 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  11. Godskesen, J.: 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)

    Chapter  Google Scholar 

  12. Godskesen, J.: A Calculus for Mobile Ad-hoc Networks with Static Location Binding. Electronic Notes in Theoretical Computer Science 242(1), 161–183 (2009)

    Article  Google Scholar 

  13. Ghassemi, F., Fokkink, W., Movaghar, A.: Restricted Broadcast Process Theory. In: SEFM, pp. 345–354. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  14. Ghassemi, F., Fokkink, W., Movaghar, A.: Equational Reasoning on Ad Hoc networks. In: Arbab, F., Sirjani, M. (eds.) FSEN 2009. LNCS, vol. 5961, pp. 113–128. Springer, Heidelberg (2010)

    Google Scholar 

  15. Mock, M., Frings, R., Nett, E., Trikaliotis, S.: Continuous Clock Synchronization in Wireless Real-Time Applications. In: SRDS, pp. 125–133. IEEE Computer Society, Los Alamitos (2000)

    Google Scholar 

  16. Ganeriwal, S., Kumar, R., Srivastava, M.: Timing-Sync Protocol for Sensor Networks. In: SenSys, pp. 138–149. ACM Press, New York (2003)

    Google Scholar 

  17. Sichitiu, M.L., Veerarittiphan, C.: Simple, Accurate Time Synchronization for Wireless Sensor Networks. In: WCNC, pp. 1266–1273. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  18. Su, W., Akyildiz, I.: Time-Diffusion Synchronization Protocols for Sensor Networks. IEEE/ACM Transactions on Networking 13(2), 384–397 (2005)

    Article  Google Scholar 

  19. Li, Q., Rus, D.: Global Clock Synchronization in Sensor Networks. IEEE Transactions on Computers 55(2), 214–226 (2006)

    Article  Google Scholar 

  20. Yoon, S., Veerarittiphan, C., Sichitiu, M.L.: Tiny-sync: Tight time synchronization for wireless sensor networks. ACM Transactions on Sensor Networks 3(2), 81–118 (2007)

    Article  Google Scholar 

  21. Sundararaman, B., Buy, U., Kshemkalyani, A.D.: Clock synchronization for wireless sensor networks: a survey. Ad Hoc Networks 3(3), 281–323 (2005)

    Article  Google Scholar 

  22. Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation 117(2), 221–239 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Prasad, K.: Broadcasting in Time. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061, pp. 321–338. Springer, Heidelberg (1996)

    Google Scholar 

  24. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Google Scholar 

  25. Rathke, J., Sassone, V., Sobocinski, P.: Semantic Barbs and Biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 302–316. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Aceto, L., Hennessy, M.: Towards action-refinement in process algebras. Information and Computation 103(2), 204–269 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  27. Prasad, K.: A Calculus of Broadcasting Systems. Science of Computer Programming 25(2-3) (1995)

    Google Scholar 

  28. Corradini, F., Ferrari, G., Pistore, M.: On the semantics of durational actions. Theoretical Computer Science 269(1-2), 47–82 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  29. Laneve, C., Zavattaro, G.: Foundations of web transactions. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 282–298. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Verona, Italy

    Massimo Merro & Eleonora Sibilio

Authors
  1. Massimo Merro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eleonora Sibilio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Mathematics and Computer Science (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Farhad Arbab

  2. Reykjavik University, School of Computer Science, Kringlan 1, 103, Reykjavik, Iceland

    Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merro, M., Sibilio, E. (2010). A Timed Calculus for Wireless Systems. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2009. Lecture Notes in Computer Science, vol 5961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11623-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11623-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11622-3

  • Online ISBN: 978-3-642-11623-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics