Series A: Research Reports, No. 8. Espoo, Finland: Helsinki Unversity of Technology, Digital Systems Laboratory, November 1988.
Abstract: The Byzantine Generals Problem requires the nonfaulty processors of a distributed network to agree upon a value even though the faulty components may interfere. In this work basic solutions using oral messages and authenticated messages are modelled with the help of predicate/transition nets. Message system models are introduced for the single Generals case, for the case of concurrent single Generals and also for the case of general consensus. The S-invariants of the nets are determined and system properties like liveness, synchronization and consistency are studied.
Keywords: message protocol (for) Byzantine generals problem; oral message; authenticated message; predicate/transition net; S-invariant; liveness; synchronization; consistency.