In: Mathematical Structures in Computer Science, Vol. 8, No. 2, pages 117-151. 1998.
Abstract: The paper introduces the notion of strongly concatenable process as a refinement of concatenable processes which can be expresses axiomatically via a functor F from the category of Petri nets to an appropriate category of symmetric strict monoidal categories, in the precise sense that, for each net N, the strongly concatenable processes of N are isomorphic to the arrows of F(N). In addition, the paper identifies a coreflection right adjoint to F and characterize its replete image, thus yielding an axiomatization of the category of net computations.
Keywords: Petri net computations, category theory, concatenable processes.