Distributed Algorithms

  • Peter Csaba ÖlveczkyEmail author
Part of the Undergraduate Topics in Computer Science book series (UTICS)


This chapter shows how Maude can be used to formally model and analyze a number of textbook distributed algorithms; that is, algorithms (or protocols) in which a number of nodes use message passing communication to achieve a common goal.

Copyright information

© Springer-Verlag London 2017

Authors and Affiliations

  1. 1.University of OsloOsloNorway

Personalised recommendations