Research Article
Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding
Algorithm 5
Converting an annotated CFP to a directed bigraph.
Function | Input: An annotated CFP where and | Output: A directed bigraph = (: condition nodes, : event nodes, : directed edges) | begin | ; | ; | ; | for do | iSuccessors; | iSuccessors; | ; | ; | ; |
|