Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T19:52:01.017Z Has data issue: false hasContentIssue false

An axiomatization of the category of Petri net computations

Published online by Cambridge University Press:  01 April 1998

VLADIMIRO SASSONE
Affiliation:
BRICS – Computer Science Department, University of AarhusBasic Research in Computer Science, Centre of the Danish National Research Foundation.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce the notion of strongly concatenable process as a refinement of concatenable processes (Degano et al. 1996), which can be expressed axiomatically via a functor [Qscr](_) 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 [Qscr](N). In addition, we identify acoreflection right adjoint to [Qscr](_) and characterize its replete image, thus yielding an axiomatization of the category of net computations.

Information

Type
Research Article
Copyright
1998 Cambridge University Press