Affordable Access

Publisher Website

Modelling solutions for agreement problems with PrT-nets

Authors
Journal
Microelectronics Reliability
0026-2714
Publisher
Elsevier
Publication Date
Volume
31
Issue
4
Identifiers
DOI: 10.1016/0026-2714(91)90005-r
Disciplines
  • Communication

Abstract

Abstract A concurrent communications system solving the Bysantine agreement problem has been modelled using Predicate/Transition Nets. The communication and computation models presented here are based on the so-called Oral Message Algorithm, a basic solution for the Bysantine 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 synchronisation of processors have been studied.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Nurse educators seek solutions to common problems...

on Nursing New Zealand (Wellingto... February 2006

Petri Nets applied to the modelling and analysis o...

on Microprocessing and Microprogr... Jan 01, 1993

Deadlocks and traps in Petri nets as Horn-satisfia...

on Discrete Applied Mathematics Jan 01, 1990
More articles like this..