Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Algorithm 2

Preprocessing an annotated CFP to a set of directed bigraphs.

function  𝑃𝑟𝑒𝑃𝑟𝑜𝑐𝑒𝑠𝑠

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

Output: A set of bigraphs 𝔾

begin

 𝔾∶=∅;

 𝕌:= GetAllExecutions(𝑈);

 for  𝑈∈𝕌  do

  𝔾∪∶=A 𝑛𝑛𝑜𝑡𝑎𝑡𝑒𝑑𝐶𝐹𝑃2𝐵𝑖𝑔𝑟𝑎𝑝ℎ(𝑈)