Paolo Baldan(1), Andrea Corradini(2) Hartmut Ehrig(3) Reiko Heckel(4)
(1) Dipartimento di Informatica, Università Ca' Foscari di Venezia (Italy)
(2) Dipartimento di Informatica, Università di Pisa (Italy)
(3) Computer Science Department, Technical University of Berlin (Germany)
(4) Dept. of Math. and Comp. Science, University of Paderborn (Germany)
We introduce a composition operation over open nets, characterized as a pushout in the corresponding category, suitable to model both interaction through open places and synchronization of transitions. The deterministic process semantics is shown to be compositional with respect to such composition operation. If a net Z3 results as the composition of two nets Z1 and Z2, having a common subnet Z0, then any two deterministic processes of Z1 and Z2 which ``agree'' on the common part, can be ``amalgamated'' to produce a deterministic process of Z3. Vice versa, any deterministic process of Z3 can be decomposed into processes of the component nets. The amalgamation and decomposition operations are shown to be inverse to each other, leading to a bijective correspondence between the deterministic processes of Z3 and pair of deterministic processes of Z1 and Z2 which agree on the common subnet Z0. Technically, our result is similar to the amalgamation theorem for data-types in the framework of algebraic specification.
A possible application field of the proposed constructions and results is the modeling of interorganizational workflows, recently studied in the literature. This is illustrated by a running example.