Orejas, Fernando; Boronat, Artur; Mylonakis, Nikos Borrowed contexts for attributed graphs. (English) Zbl 1367.68148 Ehrig, Hartmut (ed.) et al., Graph transformations. 6th international conference, ICGT 2012, Bremen, Germany, September 24–29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33653-9/pbk). Lecture Notes in Computer Science 7562, 126-140 (2012). Summary: Borrowed context graph transformation is a simple and powerful technique developed by Ehrig and König that allows us to derive labeled transitions and bisimulation congruences for graph transformation systems or, in general, for process calculi that can be defined in terms of graph transformation systems. Moreover, the same authors have also shown how to use this technique for the verification of bisimilarity. In principle, the main results about borrowed context transformation do not apply only to plain graphs, but they are generic in the sense that they apply to all categories that satisfy certain properties related to the notion of adhesivity. In particular, this is the case of attributed graphs. However, as we show in the paper, the techniques used for checking bisimilarity are not equally generic and, in particular they fail, if we want to apply them to attributed graphs. To solve this problem, in this paper, we define a special notion of symbolic graph bisimulation and show how it can be used to check bisimilarity of attributed graphs.For the entire collection see [Zbl 1246.68030]. MSC: 68Q42 Grammars and rewriting systems 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) Keywords:attributed graph transformation; symbolic graph transformation; borrowed contexts; bisimilarity PDFBibTeX XMLCite \textit{F. Orejas} et al., Lect. Notes Comput. Sci. 7562, 126--140 (2012; Zbl 1367.68148) Full Text: DOI Link