Unfolding Grammars in Adhesive Categories

Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the abstract setting of (single pushout) rewriting over adhesive categories. The unfolding construction is characterized as a coreflection, i.e. 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 mono-morphisms. Compared to 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.
Original languageEnglish
Title of host publicationAlgebra and Coalgebra in Computer Science
Subtitle of host publication Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings
PublisherSpringer Berlin Heidelberg
Pages350-366
Number of pages17
Volume5728
ISBN (Electronic)978-3-642-03741-2
ISBN (Print)978-3-642-03740-5
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'Unfolding Grammars in Adhesive Categories'. Together they form a unique fingerprint.

Cite this