The Equivalency between Logic Petri Workflow Nets and Workflow Nets

Algorithm 1

Transforming an LPWN into an equivalent WF-net.

Input: an LPWN Σ₁ = (, ; , , , )

Output: an equivalent WF-net Σ₂ = (, ; , )

    (1) WF-net. = LPWN.;

   (2) WF-net. = LPWN.

   (3) For each transition in LPWN.

   (4)    WF-net. = WF-net.    ;

   (5)    For each in

   (6)    WF-net. = WF-net.    {(, )};

   (7)    End for

   (8)    For each in

   (9)    WF-net. = WF-net.    {(, )};

 (10)    End for

  (11) For each in LPWN.

 (12)    For each in the standard form of

 (13)     WF-net. = WF-net.    ;

 (14)     For each in

 (15)        If = _•• then WF-net. = WF-net.    {(, )};

 (16)     End for

 (17)     For each in

 (18)        WF-net. = WF-net.    {(, )};

 (19)     End for

(20)    End for

 (21) End for

(22) For each in LPWN.

(23)    For each in the standard form of

(24)     WF-net. = WF-net.    ;

(25)     For each in

(26)        If = _•• then WF-net. = WF-net.    {(, )};

(27)     End for

(28)     For each in

(29)        WF-net. = WF-net.    {(, )};

(30)     End for

 (31)    End for

(32) End for