A Correctness Checking Approach for Collaborative Business Processes in the Cloud

Algorithm 1

Compute stubborn sets.

	Input: N = (P, T; F, M0, Me) and marking M
	Output: The stubborn set St(M)
(1)	pick any t  en(M);
(2)	St(M) = {t};  = {t};
(3)	while  ≠  do
(4)	pick t  ;
(5)	if t  en(M) then
(6)	Θ = {|p   s.t. M(p) = 0};
(7)	else
(8)	Θ = ;
(9)	end if
(10)	St(M) = St(M)  Θ;
(11)	=   (Θ\St(M));
(12)	end while
(13)	return St(M);