We generalise both the notion of a non-sequential process and the unfolding construction (which was previously developed for concrete formalisms such as Petri nets and graph grammars) to the abstract setting of (single pushout) rewriting of objects in adhesive categories. The main results show that processes are in one-to-one correspondence with switch-equivalent classes of derivations, and that the unfolding construction can be characterised as a coreflection, that is, the unfolding functor arises as the right adjoint to the embedding of the category of occurrence grammars into the category of grammars. As the unfolding represents potentially infinite computations, we need to work in adhesive categories with ‘well-behaved’ colimits of ω-chains of monos. Compared with previous work on the unfolding of Petri nets and graph grammars, our results apply to a wider class of systems, which is due to the use of a refined notion of grammar morphism.
|Autori:||Baldan, P.; Corradini, Andrea; Heindel, T.; Koenig, B.; Sobocinski, P.|
|Titolo:||Processes and unfoldings: concurrent computations in adhesive categories|
|Anno del prodotto:||2014|
|Digital Object Identifier (DOI):||10.1017/S096012951200031X|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|2014-MSCS-POST-ProcessesAndUnfoldings-ConcurrentComputationsInAdhesiveCategories.pdf||Documento in Post-print||Open AccessVisualizza/Apri|