Hostname: page-component-7c8c6479df-5xszh Total loading time: 0 Render date: 2024-03-28T10:59:11.757Z 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 Aarhus
Basic Research in Computer Science, Centre of the Danish National Research Foundation.

Abstract

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 a coreflection right adjoint to [Qscr ](_) and characterize its replete image, thus yielding an axiomatization of the category of net computations.

Type
Research Article
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)