Skip to main content
SpringerLink
Log in

Bisimulations for a Distributed Higher Order π-Calculus

  • Conference paper
Theoretical Aspects of Computing – ICTAC 2007 (ICTAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4711))

Included in the following conference series:

Abstract

In this paper we design a distributed variant of higher order π-calculus which takes distributed location into account. Furthermore, we present three bisimulations for such a distributed higher order π-calculus, called distributed context bisimulation, distributed normal bisimulation and distributed reduction bisimulation respectively. We prove that the three distributed bisimulations are equivalent.

This work was supported by the National Natural Science Foundation of China under Grant 60473036.

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

Access this chapter

Log in via an institution
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. Aceto, L.: A static view of localities. Formal Aspects of Computing 6(2), 201–222 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects of Computing 6, 165–200 (1994)

    Article  MATH  Google Scholar 

  3. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoretical Computer Science 114, 31–61 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Castellani, I.: Process Algebras with Localities. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, ch. 15, North-Holland, Amsterdam (2001)

    Google Scholar 

  5. Castellani, I.: Observing distribution in processes: static and dynamic localities. Int. Journal of Foundations of Computer Science 6(4), 353–393 (1995)

    Article  MATH  Google Scholar 

  6. Castellani, I., Hennessy, M.: Distributed Bisimulations. Journal of the ACM 36(4), 887–911 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corradini, F., De Nicola, R.: Locality based semantics for process algebras. Acta Informatica 34, 291–324 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Godskesen, J.C., Hildebrandt, T., Sassone, V.: A Calculus of Mobile Resources. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 272–287. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation Congruences for Homer - a Calculus of Higher Order Mobile Embedded Resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)

    Google Scholar 

  10. Hennessy, M., Rathke, J., Yoshida, N.: SafeDpi: a language for controlling mobile code. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 241–256. Springer, Heidelberg (2004)

    Google Scholar 

  11. Riely, J., Hennessy, M.: A typed language for distributed mobile processes. In: Proceedings of POPL 1998 (1998)

    Google Scholar 

  12. Sangiorgi, D.: Bisimulation in higher-order calculi. Information and Computation 131(2) (1996)

    Google Scholar 

  13. Sangiorgi, D.: Locality and interleaving semantics in calculi for mobile processes. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, Springer, Heidelberg (1994)

    Google Scholar 

  14. Sangiorgi, D.: Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D thesis, University of Einburgh (1992)

    Google Scholar 

  15. Schmitt, A., Stefani, J.: The Kell calculus: A family of higher order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, Springer, Heidelberg (2005)

    Google Scholar 

  16. Schmitt, A., Stefani, J.: The M-calculus: a higher-order distributed process calculus. ACM SIGPLAN Notices 38(1), 50–61 (2003)

    Article  Google Scholar 

  17. Vitek, J., Castagna, G.: Seal: A framework for secure mobile computations. In: Tsichritzis, D. (ed.) Workshop on Internet Programming Languages (1999)

    Google Scholar 

  18. Yoshida, N., Hennessy, M.: Subtyping and locality in distributed higher order processes. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Nanjing University of Aero. & Astro., Nanjing 210016, P. R. China

    Zining Cao

Authors
  1. Zining Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Cliff B. Jones Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao, Z. (2007). Bisimulations for a Distributed Higher Order π-Calculus. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75292-9_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75290-5

  • Online ISBN: 978-3-540-75292-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation