Research Article
Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding
Algorithm 13
Determining the Precedes relationship in the bigraph of a conflict-free annotated CFP.
| Function Precedes | | Input: A bigraph , a node , a event node , a set of nodes (the set of visited nodes) | | Output: A boolean value | | Begin | | if then | | return FALSE; | | else | | if then | | return TRUE; | | else | | if then | | return FALSE; | | else | | return |
|
