Abstract
In the area of specification and modelling of concurrent systems, Petri nets have become a standard tool, and they still work behind the scenes in tools for graph transformation systems (cf. [1]). Moreover there is still potential for crossfertilization between the graph transformation and Petri net community. Even a better understanding of adhesive categories [2] and the related concepts of [3] seems possible in light of the proposed notion of weakly adhesive categories [4], which has emerged during work on the generalization of the co-reflective semantics of Petri nets to the realm of graph transformation and adhesive rewriting systems. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Heindel, T. (2008). Grammar morphisms and weakly adhesive categories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 493–495). https://doi.org/10.1007/978-3-540-87405-8_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
