For the most recent entries see the Petri Nets Newsletter.

Modelling Solutions for the Agreement Problems with PrT-Nets.

Johansson, Kaj

Series A: Research Reports, No. 12. Espoo, Finland: Helsinki Unversity of Technology, Digital Systems Laboratory, June 1989.

Abstract: A concurrent communications sytem solving the Byzantine agreement problem is 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 are determined and system properties like liveness and synchronization of processors are studied.

Keywords: modelling agreement problem(s) (with) predicate/transition net(s); oral message algorithm; byzantine generals problem; S-invariant; liveness.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography