File(s) not publicly available
An axiomatization of the category of Petri net computations
journal contribution
posted on 2023-06-08, 09:47 authored by Vladimiro SassoneWe 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 [script 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 [script Q](N). In addition, we identify a coreflection right adjoint to [script Q](_) and characterize its replete image, thus yielding an axiomatization of the category of net computations.
History
Publication status
- Published
Journal
Mathematical Structures in Computer ScienceISSN
09601295Publisher
Cambridge University PressIssue
2Volume
8Page range
117-151ISBN
0960-1295Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC