File(s) not publicly available
An Axiomatization of the Algebra of Petri Net Concatenable Processes.
journal contribution
posted on 2023-06-07, 22:11 authored by Vladimiro SassoneThe concatenable processes of a Petri net N can be characterized abstractly as the arrows of a symmetric monoidal category View the MathML source(N). However, this is only a partial axiomatization, since it is based on a concrete, ad hoc chosen, category of symmetries SymN. In this paper we give a completely abstract characterization of the category of concatenable processes of N, thus yielding an axiomatic theory of the noninterleaving behaviour of Petri nets.
History
Publication status
- Published
Journal
Theoretical Computer ScienceISSN
03043975Publisher
ElsevierExternal DOI
Issue
1-2Volume
170Page range
277-296ISBN
0304-3975Department 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