“…It is known that languages defined by (labelled) Petri nets include regular languages, some context-free and even context-sensitive languages (Murata, 1989). Therefore, they are significantly more general than languages defined by finite automata (Chaki et al, 2004); however, the verification of component compatibility is significantly more difficult than in the case of regular languages (Craig and Zuberek, 2007;Craig, 2006).…”