Formal Modelling of PBFT Consensus Algorithm in Event-B

Listing 12

Event ‘under_low_water’.

Event under_low_water

  Anynode m node1

  Where

   @grd1 node∈NODES

   @grd2 node1∈corr

   @grd3 m∈cache(node)

   @grd4 m∉dom(G(node))

   @grd5 prj1(contents(m))<n

   @grd6 m∈dom(G(node1))

  Then

   @act1 G≔G<+{node↦G(node)∪{m↦G(node1)(m)}}

End