Compositional Process Model Synthesis Based on Interface Patterns

Abstract

Coordination of several distributed system components is an error-prone task, since interaction of several simple components can generate rather sophisticated behavior. Verification of such systems is very difficult or even impossible because of the so-called state space explosion problem, when the size of the system reachability set grows exponentially on the number of interacting agents. To overcome this problem several approaches to construct correct models of interacting agents in a compositional way were proposed in the literature. They define different properties and conditions to ensure correct behavior of interacting agents. Checking these conditions may be in its turn quite a problem.In this paper we propose patterns for correct composition of component models. For justifying these patterns we use special net morphisms. However, to apply patterns the user does not need to be familiar with the underlying theory.

Using Interface Patterns for Compositional Discovery of Distributed System Models

“…In [2] we have proposed a solution to this problem and two other patterns for composing two interacting components. The obtained composition inherits properties, such as deadlock-freeness and proper termination, from components.…”

“…To facilitate Petri net composition, we use compositional patterns for typical interface we have proposed in [2]. One of such patterns called the simple causality is schematically shown in Fig.…”

“…We compose agent models via interface patterns, which describe how they intercommunicate. This approach was presented at TMPA-2017 [2], the conference proceedings will be available later. The formal proof of the composition correctness is based on using net morphisms [3].…”