Research Article
Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding
Algorithm 4
Updating a CFP with a cut-off event that links to a continuation event outside the CFP.
function | Input: A CFP , a set of CFPs , a (cut-off) event , a (continuation) event | Output: A set of (updated) CFPs | begin | ; | /* get ready by removing the successor conditions of (in ) */ | := iSuccessors(); | ; | ; | /* retrieve and process the CFPs that contain in */ | for do | /* remove from the part before , itself, and the outgoing edges of */ | GetSubCFP_to; | ; | ; | iSuccessors; | /* connect the above (updated) and to */ | ; | ; | InitialConditions; | |
|