Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

<table>The set of conflict-free CFPs as decomposition of <span style="font-family:monospace"><svg height="15.25" id="M846" style="vertical-align:-3.13504pt" version="1.1" viewbox="0 0 30.4375 15.25" width="30.4375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M493 503l-29 -4q-13 56 -28 80q-13 22 -35.5 29.5t-78.5 7.5h-76q-22 0 -27.5 -5t-5.5 -27v-238h103q66 0 82.5 12t25.5 62h29v-193h-29q-9 54 -25.5 67t-82.5 13h-103v-181q0 -64 15 -78.5t84 -19.5v-28h-272v28q61 5 74.5 19.5t13.5 78.5v399q0 64 -13 78t-72 19v28
h440q1 -40 10 -147z" id="x46"></path></g><g transform="matrix(.017,-0,0,-.017,8.783,11.112)"><path d="M135 536q-20 0 -35 15.5t-15 35.5q0 22 15 37t36 15t35.5 -15t14.5 -37q0 -21 -15 -36t-36 -15zM252 0h-220v26q48 5 59 17t11 63v206q0 47 -9 58t-54 18v24q78 12 142 39v-345q0 -51 11.5 -63t59.5 -17v-26z" id="x69"></path></g><g transform="matrix(.017,-0,0,-.017,13.339,11.112)"><path d="M524 0h-209v26q44 5 55 18t11 65v167q0 114 -91 114q-50 0 -109 -51v-235q0 -50 10 -61.5t55 -16.5v-26h-217v26q51 5 62 17t11 61v206q0 47 -9.5 58.5t-50.5 19.5v23q82 15 139 40v-79l67 47q47 30 83 30q60 0 94.5 -40t34.5 -112v-193q0 -50 10 -61.5t54 -16.5v-26z
" id="x6E"></path></g>
<g transform="matrix(.012,-0,0,-.012,22.638,15.187)"><path d="M570 168l-39 -168h-498v23l262 301l-248 304v22h471q4 -71 11 -146l-29 -4q-17 65 -37 88q-12 15 -36 20.5t-79 5.5h-181l211 -256l-243 -287h280q51 0 77 20.5t49 83.5z" id="x3A3"></path></g>
</svg></span> in Figure <a href="../fig5/#c">5(c)</a>.</table>

Journal of Applied Mathematics

fig6

Figure 6

Figure 6: Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding 