Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="962765.fig.003a" src="https://static.hindawi.com/articles/jam/volume-2013/962765/figures/962765.fig.003a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Pattern hierarchy</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="962765.fig.003b" src="https://static.hindawi.com/articles/jam/volume-2013/962765/figures/962765.fig.003b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Scopes</td></tr></table></td></tr></table>

<table>The pattern hierarchy and the scopes in SPS.</table>

Journal of Applied Mathematics

fig3

Figure 3

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