Dynamic and Quantitative Method of Analyzing Service Consistency Evolution Based on Extended Hierarchical Finite State Automata

Algorithm 2

Pseudocode of SCEA-𝛽 algorithm.

(1) Initialize 𝑀, 𝑁, 𝐾;

(2) Num_ID,  Num_MI,  Num_SC←0; /* Counts of 𝛽’s input events are initialized */

(3) for  𝑖=1 to  𝑁  do

(4)   𝐴𝑡𝑆^𝑡_𝛼𝑖∈𝐿₀←(1, 1, 1); /* Initialize the state array of 𝛼  */

(5) endfor

(6) Select 2–4 𝛼_𝑖 stochastically which are assembled into 𝛽_𝑗;

(7) for  𝑗=1 to 𝑀  do

(8)   𝐶𝑜𝑆^𝑡_𝛽𝑗∈𝑄₀←((1,1,1),𝐴𝑡𝑆^𝑡_𝛼𝑖∪𝐴𝑡𝑆^𝑡_𝛼𝑖⋯); // Initialize the 𝛽’s state array

(9) endfor

(10)  for (𝑘=1;  𝑘++;  𝑘≤𝐾) do

(11)  update 𝐴𝑡𝑆_𝛼^𝑘+1_𝑖←𝐴𝑡𝑆^𝑘_𝛼𝑖 by Algorithm 1;

(12)   for each  𝛽_𝑗∈𝐶𝑜𝑆  do

(13)    Get current state 𝐶𝑜𝑆^𝑘_𝛽𝑗;

(14)    Find the rules 𝑡𝑠∈𝑇𝑆  at 𝐶𝑜𝑆^𝑘_𝛽𝑗;

(15)    Select 𝑐_𝑠∈𝐶𝐼 according to its event probability;

(16)    Execute operation  𝐶𝑜𝑆_𝛽^𝑘+1_𝑖←𝛿𝐶𝑜𝑆^𝑘_𝛽𝑖,𝑐_𝑠; /* Transition happens */

(17)    if  𝑐_𝑠==𝑐₁  then

(18)    Num_ID++; /* Add the number of event 𝑐₁  */

(19)    else  𝑐_𝑠==𝑐₂

(20)   Num_MI++; /* Count the number of event 𝑐₂  */

(21)    else  𝑐_𝑠==𝑐₃

(22)   Num_SC++;  /* Add the number of event 𝑐₃  */

(23)    endif

(24)     endfor

(25)    endfor