Sciweavers

TAPSOFT
1995
Springer
13 years 8 months ago
On the Category of Petri Net Computations
Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] from the c...
Vladimiro Sassone
FCT
1995
Springer
13 years 8 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