Skip to main content

Social confluence in client-server systems

  • Conference paper
  • First Online:
  • 3140 Accesses

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

Abstract

An extension to the theory of partial confluence of concurrent systems is presented in the setting of the polyadic π-calculus. The main result, expressed in terms of client-server systems, is that in certain client contexts, a member of a class of concurrent servers which may perform up to one state-changing internal action in determining the answer to a client's question is indistinguishable from a serial server.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. X. Liu and D. Walker. Confluence of processes and systems of objects. In Proceedings of TAPSOFT'95, pages 217–231. Springer, 1995.

    Google Scholar 

  2. R. Milner. A Calculus of Communicating Systems. Springer, 1980.

    Google Scholar 

  3. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  4. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer, 1992.

    Google Scholar 

  5. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts 1 and 2. Information and Computation, 100:1–77, 1992.

    Google Scholar 

  6. A. Philippou. Reasoning about systems with evolving structure. PhD thesis, University of Warwick, 1996.

    Google Scholar 

  7. A. Philippou and D. Walker. On transformations of concurrent object programs. In Proceedings of CONCUR'96, pages 131–146. Springer, 1996.

    Google Scholar 

  8. A. Philippou and D. Walker. A rigorous analysis of concurrent operations on B-trees. In Proceedings of CONCUR'97. Springer, to appear.

    Google Scholar 

  9. D. Sangiorgi. The name discipline of uniform receptiveness. In Proceedings of ICALP'97. Springer, to appear.

    Google Scholar 

  10. C. Tofts. Proof methods and pragmatics for parallel programming. PhD thesis, University of Edinburgh, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dirk van Dalen Marc Bezem

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Philippou, A., Walker, D. (1997). Social confluence in client-server systems. In: van Dalen, D., Bezem, M. (eds) Computer Science Logic. CSL 1996. Lecture Notes in Computer Science, vol 1258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63172-0_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-63172-0_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63172-9

  • Online ISBN: 978-3-540-69201-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics