Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Figure 5

Illustration of unfolding and complete finite prefix using the Petri net Σ adapted from [7] (the net in (a) without 𝑠₀, 𝑠₈, 𝐴, and 𝐼 is the same as the example net in Figure 1 in [7]).

(a) A Petri net Σ

(b) The unfolding Unf_Σ

(c) The CFP Fin_Σ annotated with explicit links from cut-off events to continuation events