Formal verification of a leader election protocol in process algebra

DOI10.1016/S0304-3975(96)00256-3zbMath0911.68057OpenAlexW2118150420MaRDI QIDQ1391796

Jan Friso Groote, Lars-åke Fredlund, Henri Korver

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00256-3

zbMATH Keywords

process algebradistributed algorithm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Focus points and convergent process operators: A proof strategy for protocol verification, Cones and foci: A mechanical framework for protocol verification, Two finite specifications of a queue, Distributed consensus, revisited, An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP, The parallel composition of uniform processes with data, The cones and foci proof technique for timed transition systems

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence for process verification
• The calculus of constructions
• A calculus of communicating systems
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Process Algebra
• Design and analysis of dynamic leader election protocols in broadcast networks