?-Ind Completion of Monoidal Categories and Infinite Petri Net Computations.


Meseguer, J., Montanari, U. and Sassone, V. (1993) ?-Ind Completion of Monoidal Categories and Infinite Petri Net Computations. At Workshop on Topology and Completion in Semantics, France. , 51 pp..

Download

[img] PDF w-ind-compl.pdf - Other
Download (608kB)

Description/Abstract

There exists a KZ-doctrine on the 2-category of the locally small categories whose algebras are exactly the categories which admits all the colimits indexed by $\omega$-chains. The paper presents a wide survey of this topic. In addition, we show that this chain cocompletion KZ-doctrine lifts smoothly to KZ-doctrines on (many variations of) the 2-categories of monoidal and symmetric monoidal categories, thus yielding a universal construction of colimits of $\omega$-chains in those categories. Since the processes of Petri nets may be axiomatized in terms of symmetric monoidal categories this result provides a universal construction of the algebra of infinite processes of a Petri net.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: 1993
Venue - Dates: Workshop on Topology and Completion in Semantics, France, 1993-01-01
Keywords: petri nets semantics, infinite computations, symmetric monoidal categories, omega inductive completion of categories
Organisations: Web & Internet Science
ePrint ID: 261872
Date :
Date Event
1993Published
Date Deposited: 28 Jan 2006
Last Modified: 17 Apr 2017 21:51
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/261872

Actions (login required)

View Item View Item