Formal Modelling of PBFT Consensus Algorithm in Event-B

Listing 15

Invariants of M2.

  @inv1 G_p∈NODES→ℙ(ℕ×(ℕ×value))

  @inv2 G_pre∈NODES→(NODES⇸ℙ(ℕ×(ℕ×value)))

  @inv3 G_r∈NODES→(NODES⇸ℙ(ℕ×(ℕ×value)))

  @inv4 G_pre_check∈NODES→ℙ(ℕ×(ℕ×value))

  @inv5 G_r_check∈NODES→ℙ(ℕ×(ℕ×value))

  @inv6 ∀i,j·i∈dom(cache)∧j∈cache(i)⇔

  i∈dom(G_p)∧contents(j)∈ran(G_p(i))