Coreflective Concurrent Semantics
for Single-Pushout Graph Grammars
Paolo Baldan(1), Andrea Corradini(2), Ugo Montanari(2), Leila Ribeiro(3)
(1) Dipartimento di Informatica, Università Ca' Foscari di Venezia, Italia.
(2) Dipartimento di Informatica, Università di Pisa, Italia.
(3) Instituto de Informática, Universidade Federal do Rio
Grande do Sul, Brazil
Abstract:
The problem of extending to graph grammars the unfolding semantics
originally developed by Winskel for (safe) Petri nets has been faced
several times along the years, both for the single-pushout and
double-pushout approaches, but only partial results were
obtained.
In this paper we fully extend Winskel's approach to single-pushout
grammars providing them with a categorical concurrent semantics
expressed as a coreflection between the category of graph grammars
and the category of prime algebraic domains.