Research Article
A Correctness Checking Approach for Collaborative Business Processes in the Cloud
Algorithm 2
Compute the reduced state space.
| | Input: N = (P, T; F, M0, Me) | | | Output: The reduced state space SSG; | | (1) | define SSG = (N, E, M0, Me); | | (2) | tag M0; | | (3) | add M0 to Υ and N; | | (4) | while Υ ≠ do | | (5) | pick any M Υ; | | (6) | generate the stubborn set St(M) of M; | | (7) | for each tSt(M) do | | (8) | compute M[t > M’; | | (9) | add (M, t, M′) to E; | | (10) | if M′ is untagged then | | (11) | tag M’; | | (12) | add M′ to Υ and N; | | (13) | end if | | (14) | end for | | (15) | return SSG; |
|