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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Baldan, P., Corradini, A., Montanari, U., & Ribeiro, L. (2003). Coreflective concurrent semantics for single-pushout graph grammars. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2755, 165–184. https://doi.org/10.1007/978-3-540-40020-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
