Modeling Consensus in a Process Calculus | SpringerLink
Skip to main content

Modeling Consensus in a Process Calculus

  • Conference paper
CONCUR 2003 - Concurrency Theory (CONCUR 2003)

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

Included in the following conference series:

Abstract

We give a process calculus model that formalizes a well-known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (\(\diamondsuit \mathcal{S}\)); we use our model to formally prove that the algorithm satisfies its specification.

Supported by the Swiss National Science Foundation, grant No. 21-67715.02, the Hasler Foundation, grant No. DICS 1825, an EPFL start-up grant, and the EU FET-GC project PEPITO. The full version is available at: http://lamp.epfl.ch/~uwe/

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Berger, M., Honda, K.: The Two-Phase Commitment Protocol in an Extended pi-Calculus. In: Aceto, L., Victor, B. (eds.) Proceedings of EXPRESS 2000. ENTCS, vol. 39.1. Elsevier Science Publishers, Amsterdam (2000)

    Google Scholar 

  2. Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. Journal of the ACM 43(4), 685–722 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra, T.D., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Fisher, M.J., Lynch, N., Patterson, M.: Impossibility of Distributed Concensus with One Faulty Process. Journal of the ACM 32(2), 374–382 (1985)

    Article  Google Scholar 

  5. Pogosyants, A., Segala, R., Lynch, N.: Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: a Case Study. Distributed Computing 13(3), 155–186 (2000)

    Article  Google Scholar 

  6. Riely, J., Hennessy, M.: Distributed Processes and Location Failures. Theoretical Computer Science 226, 693–735 (2001)

    Article  MathSciNet  Google Scholar 

  7. Wojciechowski, P., Sewell, P.: Nomadic Pict: Language and Infrastructure Design for Mobile Agents. IEEE Concurrency 8(2), 42–52 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nestmann, U., Fuzzati, R., Merro, M. (2003). Modeling Consensus in a Process Calculus. In: Amadio, R., Lugiez, D. (eds) CONCUR 2003 - Concurrency Theory. CONCUR 2003. Lecture Notes in Computer Science, vol 2761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45187-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45187-7_26

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45187-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics