Some formalisms account for specifications and are therefore used for modeling certain aspects of systems. The modeling efforts then translate to means in which verification of specific properties can take place under certain conditions. Some properties are reachability [1]}, progress [2]} or liveness [3]}, maximality [2]}, and safety [3]}, [2]}, [7]}. The path toward achieving verification of such properties involves creating counterpart representatives in formalisms like timed automata, Petri nets, or some extensions thereof, such as hybrid I/O automata [8]} or high-level Petri nets. Researchers have proposed different mappings to various formalisms or extensions thereof. The degree of coverage in these efforts also varies. Some of them account for basic elements [9]}, while others account for a wider set of constructs and definitions [10]}, such as the ones defined in the activity metamodel [11]}. For example, the latter includes detailed treatment for the semantics of various activity constructs such as executable node, control nodes, and various patterns of activity edges. The work concludes, however, with some critical remarks about the feasibility of aligning activities to Petri nets and vice versa.
