Consistency verification of algorithm
no vote
we introduce a novel Broadcast-Free Algorithm that solves Consensus problem in the presence of a Weak-Fairness property and an unreliable failure detector -property, in asynchronous distributed systems, and later its formal verication. The Broadcast-Free Algorithm Model is dened as a global transition system that is unambigously generated by local transition rules. At the system run, the algorithm model attempts involves two concepts : one to system run represents a innite computation and one to asynchronous communication between processes without Broadcast.