Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Algorithm 5

Converting an annotated CFP to a directed bigraph.

Function  𝐴𝑛𝑛𝑜𝑡𝑎𝑡𝑒𝑑𝐶𝐹𝑃2𝐵𝑖𝑔𝑟𝑎𝑝ℎ

Input: An annotated CFP 𝑈=(𝜌,𝐿) where 𝜌=(𝐵,𝐸,𝐹) and 𝐿⊆𝐸×𝐸

Output: A directed bigraph 𝐺 = (𝑉_{𝑐𝑜𝑛𝑑}: condition nodes, 𝑉_{𝑒𝑣𝑒𝑛𝑡}: event nodes, 𝐴: directed edges)

begin

 𝑉_{𝑐𝑜𝑛𝑑}∶=𝐵;

 𝑉_{𝑒𝑣𝑒𝑛𝑡}∶=𝐸;

 𝐴∶=𝐹;

 for (𝑒₁,𝑒₂)∈𝐿  do

  𝐵₁∶=  iSuccessors(𝑒₁);

  𝐵₂∶=  iSuccessors(𝑒₂);

  𝑉_{𝑐𝑜𝑛𝑑}⧵∶=𝐵₁;

  𝐴⧵∶={𝑒₁}×𝐵₁;

  𝐴∪∶={𝑒₁}×𝐵₂;