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

Algorithm 1

Pseudocode of SCEA-𝛼 algorithm.

(1) Initialize 𝑁,  𝐾;

(2) Num_VM,  Num_SE,  Num_SR←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) for (𝑘=1;  𝑘++;  𝑘≤𝐾) do

(7)   for each  𝜶_𝐢∈  AtS do

(8)    Get current state  𝐴𝑡𝑆^𝑡_𝛼𝑖;

(9)    Find the rules ts  ∈  TS at  𝐴𝑡𝑆^𝑡_𝛼𝑖;

(10)    Select 𝑎_𝑠 ∈  AI according to its event probability;

(11)     Execute operation 𝐴𝑡𝑆^𝑡_𝛼𝑖←𝛿𝐴𝑡𝑆^𝑡_𝛼𝑖,𝑎_𝑠;   /* Trigger a state transition */

(12)     if  𝑎_𝑠==𝑎₁  then

(13)   Num_VM++; /* Count the number of event 𝑎₁  */

(14)     else  𝑎_𝑠==𝑎₂

(15)   Num_SE++; /* Add the number of event 𝑎₂  */

(16)     else  𝑎_𝑠==𝑎₃

(17)   Num_SR++;  /* Add the number of event 𝑎₃  */

(18)     endif

(19)      endfor

(20)   endfor