Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonchi, F., Gadducci, F., König, B.: Synthesising CCS bisimulation using graph rewriting. Inf. Comput. 207(1), 14–40 (2009)
Bonchi, F., Gadducci, F., Monreale, G.V., Montanari, U.: Saturated LTSs for Adhesive Rewriting Systems. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 123–138. Springer, Heidelberg (2010)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Comp. Sc. Springer (2006)
Ehrig, H., Padberg, J., Prange, U., Habel, A.: Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae 74(1), 1–29 (2006)
Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science 16(6), 1133–1163 (2006)
Hülsbusch, M., König, B.: Deriving Bisimulation Congruences for Conditional Reactive Systems. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 361–375. Springer, Heidelberg (2012)
Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39, 511–545 (2005)
Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. In: Int. Coll. on Graph and Model Transformation On the Occasion of the 65th Birthday of Hartmut Ehrig (2010)
Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294–315 (2011)
Orejas, F., Lambers, L.: Lazy Graph Transformation. Fundamenta Informaticae 118(1-2), 65–96 (2012)
Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)
Rangel, G., König, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. ECEASST 6 (2007)
Sangiorgi, D.: On the Proof Method for Bisimulation (Extended Abstract). In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 479–488. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Orejas, F., Boronat, A., Mylonakis, N. (2012). Borrowed Contexts for Attributed Graphs. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Graph Transformations. ICGT 2012. Lecture Notes in Computer Science, vol 7562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33654-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-33654-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33653-9
Online ISBN: 978-3-642-33654-6
eBook Packages: Computer ScienceComputer Science (R0)