Formal Modelling of PBFT Consensus Algorithm in Event-B

Listing 1

Context of M0.

Sets

Message result

Constants

CORR NODES True_execute FAULTY

Axioms

   @axm0 NODES⊆ℕ

  @axm1 finite(NODES)

  @axm2 NODES≠∅

 @axm3 CORR⊆NODES

  @axm4 CORR≠∅

  @axm5 3(CORR) ≥2(NODES) +1

  @axm6 result≠∅

  @axm7 FAULTY∈result

 @axm8 True_execute∈message↔result∖{FAULTY}

 End