An Axiomatization of the Category of Petri Net Computations.
Mathematical Structures in Computer Science, 8, .
We introduce the notion of strongly concatenable process as a refinement of concatenable processes which can be expressed axiomatically via a functor Qn(_) 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 Qn(N). In addition, we identify a coreflection right adjoint to Qn(_) and characterize its replete image, thus yielding an axiomatization of the category of net computations.
Actions (login required)