FCT   1995 Fundamentals of Computation Theory
Wall of Fame | Most Viewed FCT-1995 Paper
10 years 6 months ago
Axiomatizing Petri Net Concatenable Processes
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...
Vladimiro Sassone
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source143
2Download preprint from source123
3Download preprint from source94
4Download preprint from source82
5Download preprint from source80