An Approach to the Category of Net Computations
At 6th Nordic Workshop on Programming Theory, NWPT '94..
We introduce the notion of strongly concatenable process as a refinement of concatenable processes [DMM89] 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.
Conference or Workshop Item
||Organisation: University of Aarhus
|Venue - Dates:
||6th Nordic Workshop on Programming Theory, NWPT '94., 1994-01-01
||petri nets processes, petri nets semantics, symmetric monoidal categories
||Web & Internet Science
||12 Feb 2006
||17 Apr 2017 21:50
|Further Information:||Google Scholar|
Actions (login required)