Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Algorithm 12

Determining the intermediate predicate Pred.

function  PRED

Input: Two taskID 𝑡_{𝑓𝑜𝑟𝑚𝑒𝑟} and 𝑡_{𝑙𝑎𝑡𝑡𝑒𝑟}, a bigraph 𝐺

Output: A boolean value

begin

 𝑊∶=  RetrieveAllEvents(𝐺,𝑡_{𝑓𝑜𝑟𝑚𝑒𝑟});

 𝑋∶=  RetrieveAllEvents(𝐺,𝑡_{𝑙𝑎𝑡𝑡𝑒𝑟});

 return ∃_𝑒∈𝑊∃_{𝑒′∈𝑋}𝑃𝑟𝑒𝑐𝑒𝑑𝑒𝑠(𝐺,𝑒,𝑒^′,∅)