Skip to main content

Travelling Processes

  • Conference paper
Mathematics of Program Construction (MPC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3125))

Included in the following conference series:

Abstract

This paper describes a refinement-based development method for mobile processes. Process mobility is interpreted as the assignment or communication of higher-order variables, whose values are process constants or parameterised processes, in which target variables update their values and source variables lose their values. The mathematical basis for the work is Hoare and He’s Unifying Theories of Programming (UTP). In this paper, we present a set of algebraic laws to be used for the development of mobile systems. The correctness of these laws is ensured by the UTP semantics of mobile processes. We illustrate our theory through a simple example that can be implemented in both a centralised and a distributed way. First, we present the π-calculus specification for both systems and demonstrate that they are observationally equivalent. Next, we show how the centralised system may be step-wisely developed into the distributed one using our proposed laws.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnes, F.R.M., Welch, P.H.: Prioritised dynamic communicating and mobile processes. IEE Proceedings Software 150(2), 121–136 (2003)

    Article  Google Scholar 

  2. Cavalcanti, L.C., Sampaio, A.C.A., Woodcock, J.C.P.: Refinement of actions in Circus. In: REFINE 2002, Electronic notes in Theoretical Computer Science (2002)

    Google Scholar 

  3. Cavalcanti, L.C., Sampaio, A.C.A., Woodcock, J.C.P.: A refinement strategy for Circus. Formal Aspects of Computing, (15), 146–181 (2003)

    Google Scholar 

  4. Hoare, C.A.R.: Communicating Sequential Process. Prentice-Hall, Englewood Cliffs (1985)

    Google Scholar 

  5. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  6. INMOS Limited. occam2.1 reference manual. Technical report (May 1995)

    Google Scholar 

  7. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, parts I and II. Technical Report ECS-LFCS-89-85 and -86, University of Edinburgh (1989)

    Google Scholar 

  8. Milner, R.: Communicating and Mobile Systems: the π-calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  9. Morgan, C.: Programming from Specifications, 2nd edn. Prentice Hall, Englewood Cliffs (1998)

    Google Scholar 

  10. Roscoe, W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  11. Sampaio, C.A., Woodcock, J.C.P., Cavalcanti, A.L.C.: Refinement in Circus. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 451–470. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Sangiorgi, D.: Expressing Mobility in Process Algebras: First-order and Higherorder Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh (1992)

    Google Scholar 

  13. Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  14. Tang, X.: Mobile processes in unifying theories. Technical report 1-04, Computing Laboratory, University of Kent, Canterbury, Kent CT2 7NF, UK (January 2004)

    Google Scholar 

  15. Woodcock, J.C.P., Cavalcanti, A.L.C.: A concurrent language for refinement. In: Butterfield, A., Paul, C. (eds.) IWFM 2001: 5th Irish Workshop in Formal Methods, Dublin, Ireland (July 2001)

    Google Scholar 

  16. Woodcock, J.C.P., Cavalcanti, A.L.C.: The semantics of Circus. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 184–203. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, X., Woodcock, J. (2004). Travelling Processes. In: Kozen, D. (eds) Mathematics of Program Construction. MPC 2004. Lecture Notes in Computer Science, vol 3125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27764-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27764-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22380-1

  • Online ISBN: 978-3-540-27764-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics