On the Category of Petri Net Computations

Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] 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 Q[N]. In addition, we identify a coreflection right adjoint to Q[ ] and characterize its replete image, thus yielding an axiomatization of the category of net computations.

• Type: Conference
• Year: 1995
• Where: TAPSOFT
• Authors: Vladimiro Sassone
• Keywords: Concatenable Processes, Coreflection Right Adjoint, Software Engineering, Strict Monoidal Categories, TAPSOFT 1995