Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Algorithm 1

Computation of an annotated CFP via an adaption of Algorithm 4.7 in [7].

Input: An 𝑛-safe Petri net system Σ=(𝑃,𝑇,𝐹,𝑀₀)

Output: Fin^𝑎(𝑁∶𝑁𝑒𝑡,𝐿∶𝐿𝑖𝑛𝑘𝑠) an annotated CFP of Σ

begin

 Fin𝑎 .𝑁∶= {(𝑠,∅)∣𝑀₀(𝑠)>0∧𝑠∈𝑃};

 Fin^𝑎.𝐿∶= ∅;

 𝑝𝑒∶= 𝑃𝐸(Fin^𝑎.𝑁);

 𝑐𝑢𝑡_𝑜𝑓𝑓∶= ∅;

 while  𝑝𝑒≠∅  do

  𝑒∶=𝑚𝑖𝑛𝑖𝑚𝑎𝑙(𝑝𝑒,≺);

  If  𝑒𝑥𝑝𝑎𝑛𝑠𝑖𝑜𝑛_𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑(𝑒,𝑐𝑢𝑡_𝑜𝑓𝑓)  then

   Fin^𝑎.𝑁∪∶={(𝑒.𝑡,•𝑒)}∪{(𝑠,𝑒)∣𝑠∈𝑒.𝑡•};

   𝑝𝑒∶=𝑃𝐸(Fin^𝑎.𝑁);

   if  𝑐𝑢𝑡_𝑜𝑓𝑓_𝑒𝑣𝑒𝑛𝑡(𝑒, Fin^𝑎.𝑁, 𝑐)  then

    𝑐𝑢𝑡_𝑜𝑓𝑓∪∶={𝑒};

    Fin^𝑎.𝐿∪∶={(𝑒,𝑐)};

  else  𝑝𝑒⧵∶={𝑒}