Skip to main content

Symmetric and Synchronous Communication in Peer-to-Peer Networks

  • Conference paper
Mathematics of Program Construction (MPC 2008)

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

Included in the following conference series:

  • 502 Accesses

Abstract

Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer networks and appropriate symmetry concepts in the context of Communicating Sequential Processes (CSP) [1]. We then prove that CSP with input and output guards makes common knowledge in symmetric peer-to-peer networks possible, but not the restricted version which disallows output statements in guards and is commonly implemented. Our results extend [2].

An extended version is available at http://arxiv.org/abs/0710.2284 .

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. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21, 666–677 (1978)

    Article  MATH  Google Scholar 

  2. Bougé, L.: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Informatica 25, 179–201 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  3. Halpern, J.Y.: A computer scientist looks at game theory. Games and Economic Behavior 45, 114–131 (2003)

    Article  MATH  Google Scholar 

  4. Gray, J.: Notes on Data Base Operating Systems. LNCS, vol. 60, pp. 393–481. Springer, Heidelberg (1978)

    Google Scholar 

  5. Rubinstein, A.: The electronic mail game: Strategic behavior under almost common knowledge. The American Economic Review 79, 385–391 (1989)

    Google Scholar 

  6. Morris, S.: Coordination, communication, and common knowledge: A retrospective on the electronic-mail game. Oxf Rev Econ Policy 18, 433–445 (2002)

    Article  Google Scholar 

  7. Fagin, R., Halpern, J.Y., Vardi, M.Y., Moses, Y.: Reasoning about knowledge. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

  8. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37, 549–587 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  9. Schneider, F.B.: Synchronization in distributed programs. ACM Trans. Program. Lang. Syst. 4, 125–148 (1982)

    Article  MATH  Google Scholar 

  10. Osborne, M.J.: An Introduction to Game Theory. Oxford University Press, New York (2003)

    Google Scholar 

  11. Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  12. Andrews, G.R.: Concurrent Programming: Principles and Practice. Addison-Wesley, Reading (1991)

    Google Scholar 

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

    MATH  Google Scholar 

  14. Schneider, S.: Concurrent and Real Time Systems: The CSP Approach. John Wiley and Sons, Chichester (1999)

    Google Scholar 

  15. INMOS Ltd. occam 2 Reference Manual. Prentice-Hall (1988)

    Google Scholar 

  16. Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing 16, 121–163 (2003)

    Article  Google Scholar 

  17. Buckley, G.N., Silberschatz, A.: An effective implementation for the generalized input-output construct of csp. ACM Trans. Program. Lang. Syst. 5, 223–235 (1983)

    Article  MATH  Google Scholar 

  18. Welch, P.: An occam-pi Quick Reference (1996–2007), https://www.cs.kent.ac.uk/research/groups/sys/wiki/OccamPiReference

  19. Welch, P., Brown, N., Moores, J., Chalmers, K., Sputh, B.: Integrating and extending JCSP. In: McEwan, A.A., Schneider, S., Ifill, W., Welch, P. (eds.) Communicating Process Architectures. IOS Press, Amsterdam (2007)

    Google Scholar 

  20. Jones, G.: On guards. In: Muntean, T. (ed.) Parallel Programming of Transputer Based Machines (OUG-7), pp. 15–24. IOS Press, Amsterdam (1988)

    Google Scholar 

  21. Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Mathematical Structures in Computer Science 13, 685–719 (2003)

    Article  MathSciNet  Google Scholar 

  22. Parikh, R., Krasucki, P.: Communication, consensus, and knowledge. Journal of Economic Theory 52, 178–189 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  23. Weinstein, J., Yildiz, M.: Impact of higher-order uncertainty. Games and Economic Behavior 60, 200–212 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Bernstein, A.: Output guards and nondeterminism in Communicating Sequential Processes. ACM Trans. Program. Lang. Syst. 2, 234–238 (1980)

    Article  Google Scholar 

  25. Kurki-Suonio, R.: Towards programming with knowledge expressions. In: 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL), pp. 140–149. ACM Press, St. Petersburg Beach (1986)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Philippe Audebaud Christine Paulin-Mohring

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Witzel, A. (2008). Symmetric and Synchronous Communication in Peer-to-Peer Networks. In: Audebaud, P., Paulin-Mohring, C. (eds) Mathematics of Program Construction. MPC 2008. Lecture Notes in Computer Science, vol 5133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70594-9_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70594-9_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70593-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics