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 monomorphisms. 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.
Using ω-adhesive categories, i.e. adhesive categories in which colimits of ω-chains of monomorphisms are Van Kampen, it is possible to give such a coreflective unfolding semantics for grammars which rewrite objects of an ω-adhesive category REF .
Unfolding grammars in adhesive categories
IN ALGEBRA AND COLAGEBRA IN COMPUTER SCIENCE, CALCO’09
Computer Science