In: Microelectronics and Reliability, Vol. 31, No. 4, pages 595-606. 1991.
Abstract: A concurrent communications system solving the Byzantine agreement problem has been modelled using Predicate/Transition Nets. The communication and computation models presented are based on the so-called Oral Message Algorithm, a basic solution for the Byzantine Generals Problem. The models exhibit concurrency both in the communication and computation functions and demonstrate the symmetry between these two phases of the solution. The S-invariants of the resulting nets have been determined and system properties like liveness and synchronization of processors have been studied.
Keywords: Byzantine agreement agreement problem sulution (with) predicate/transition net(s); concurrent communications system; oral message algorithm; S-invariant; liveness; processor synchronization.