?-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. In, Workshop on Topology and Completion in Semantics, Chartres, France, , 51 pp..


[img] PDF
Download (594Kb)


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
Keywords: petri nets semantics, infinite computations, symmetric monoidal categories, omega inductive completion of categories
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 261872
Accepted Date and Publication Date:
Date Deposited: 28 Jan 2006
Last Modified: 31 Mar 2016 14:04
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/261872

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics