Skip to main content

A Fully Abstract View for Local Cause Semantics

  • Conference paper

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

Abstract

Recent technological trends have pushed concurrency and mobile computing to the mainstream. Too many semantics have been proposed to picture the behavior of concurrent systems, and their relationship has been a hot topic in concurrency. We aim in this paper to bridge two important concurrent semantics, the true concurrency semantics and the interleaving semantics, based on the local cause semantics, in the framework of mobile computing. We enrich the polyadic π-calculus with the local cause semantics, and present a fully abstract, finiteness-respecting encoding from the local cause polyadic π-calculus to the polyadic π-calculus. Therefore, the local cause bisimulation is reduced to the observation bisimulation. Moreover, a new decidable approach is proposed for the local cause bisimulation on finite processes.

Keywords

  • Cloud Computing
  • Mobile Computing
  • Proof System
  • Axiomatic System
  • Semantic Rule

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boudol, G., Castellani, I., Hennessy, M., Nielsen, M., Winskel, G.: Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Montanari Festschrift. LNCS, vol. 5065, pp. 757–777. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  2. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A Theory of Processes with Localities. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 108–122. Springer, Heidelberg (1992)

    CrossRef  Google Scholar 

  3. Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Inf. 35(5), 353–400 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. De Nicola, R., Mantanari, U., Vaandrager, F.: Back and Forth Bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152–165. Springer, Heidelberg (1990)

    Google Scholar 

  5. Degano, P., Priami, C.: Proved Trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 629–640. Springer, Heidelberg (1992)

    CrossRef  Google Scholar 

  6. Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theoretical Computer Science 216, 237–270 (1999)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Fu, Y., Lu, H.: On the expressiveness of interaction. Theoretical Computer Science 411, 1387–1451 (2010)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Fu, Y., Zhu, H.: The name-passing calculus (2011) (submitted)

    Google Scholar 

  9. Kiehn, A.: Proof Systems for Cause Based Equivalences. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 547–556. Springer, Heidelberg (1993)

    CrossRef  Google Scholar 

  10. Kiehn, A.: Comparing locality and causality based equivalences. Acta Informatica 31(8), 697–718 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Milner, R.: Communication and Concurrency. Prentice Hall (1989)

    Google Scholar 

  12. Milner, R.: The polyadic π-calculus: a tutorial. In: Proceedings of the 1991 Marktoberdorf Summer School on Logic and Algebra of Specification. NATO ASI, Series F, Springer (1993)

    Google Scholar 

  13. Moller, F.: The nonexistence of finite axiomatisations for ccs congruences. In: LICS 1990, pp. 142–153 (1990)

    Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Sangiorgi, D.: Expressing Mobility in Process Algebras: First Order and Higher Order Paradigm. PhD thesis, Department of Computer Science, University of Edinburgh (1992)

    Google Scholar 

  16. Sangiorgi, D.: Locality and True-Concurrency in Calculi for Mobile Processes. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 405–424. Springer, Heidelberg (1994)

    CrossRef  Google Scholar 

  17. Xue, J., Dong, X.: A fully abstract view for local cause semantics (2012) full version, http://basics.sjtu.edu.cn/~jianxin/

  18. Zhu, H.: Model Independent Theory of Mobile Calculi. PhD thesis, Shanghai Jiao Tong University (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xue, J., Dong, X. (2012). A Fully Abstract View for Local Cause Semantics. In: Li, R., Cao, J., Bourgeois, J. (eds) Advances in Grid and Pervasive Computing. GPC 2012. Lecture Notes in Computer Science, vol 7296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30767-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30767-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30766-9

  • Online ISBN: 978-3-642-30767-6

  • eBook Packages: Computer ScienceComputer Science (R0)