Formal verification of a leader election protocol in process algebra
- 15 May 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 177 (2) , 459-486
- https://doi.org/10.1016/s0304-3975(96)00256-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Design and analysis of dynamic leader election protocols in broadcast networksDistributed Computing, 1996
- A Correctness Proof of the Bakery Protocol in μCRLPublished by Springer Nature ,1995
- The Syntax and Semantics of μCRLPublished by Springer Nature ,1995
- Algebraic Specification of Dynamic Leader Election Protocols in Broadcast NetworksPublished by Springer Nature ,1995
- Process Specification in a UNITY FormatPublished by Springer Nature ,1995
- A Correctness Proof of a One-bit Sliding Window Protocol in CRLThe Computer Journal, 1994
- Parallel program design: a foundation: Chandry, K M and Misra, J Addison-Wesley, Wokingham, UK (1988) £19.95 pp 516Microprocessors and Microsystems, 1989
- The calculus of constructionsInformation and Computation, 1988
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema ProblemACM Transactions on Programming Languages and Systems, 1982