Abstract
In the last few years the problem of deriving labelled transitions and bisimulation congruences from unlabelled reaction or rewriting rules has received great attention. This line of research was motivated by the theory of bisimulation congruences for process calculi, such as the π-calculus [19,14]. A bisimilarity defined on unlabelled reduction rules is usually not a congruence, that is, it is not closed under the operators of the process calculus. Congruence is a desirable property since it allows one to replace a subsystem with an equivalent one without changing the behaviour of the overall system and futhermore helps to make bisimilarity proofs modular.
Research partially supported by the DFG project SANDS and CRUI/DAAD Vigoni “Models based on Graph Transformation Systems: Analysis and Verification”.
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
Baldan, P., Ehrig, H., König, B.: Composition and decomposition of DPO transformations with borrowed context. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 153–167. Springer, Heidelberg (2006)
Bonchi, F., Gadducci, F., König, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168–183. Springer, Heidelberg (2006)
Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, IEEE Computer Society Press, Los Alamitos (2006)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic approaches to graph transformation—part I: Basic concepts and double pushout approach. In: Rozenberg, G., (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, ch. 3. World Scientific (1997)
Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: An algebraic approach. In: Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 167–180. IEEE Computer Society Press, Los Alamitos (1973)
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)
Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) Proceedings of the 17th MFPS. Electronic Notes in Computer Science, vol. 45, Elsevier Science, Amsterdam (2001)
Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science 285(2), 319–358 (2002)
Jensen, O.H., Milner, R.: Bigraphs and transitions. In: Proc. of POPL 2003, pp. 38–49. ACM Press, New York (2003)
König, B.: A graph rewriting semantics for the polyadic π-calculus. In: Proc. of GT-VMT ’00 (Workshop on Graph Transformation and Visual Modeling Techniques), pp. 451–458. Carleton Scientific (2000)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. RAIRO – Theoretical Informatics and Applications 39(3) (2005)
Leifer, J.J.: Operational congruences for reactive systems. PhD thesis, University of Cambridge Computer Laboratory (September 2001)
Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, Springer, Heidelberg (2000)
Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol. 623, Springer, Heidelberg (1992)
Montanari, U., Pistore, M.: Concurrent semantics for the π-calculus. Electronic Notes in Theoretical Computer Science 1 (1995)
Rangel, G., König, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. In: Proc. of GT-VMT 2007 (Workshop on Graph Transformation and Visual Modeling Techniques), Electronic Communications of the EASST (to appear)
Rozenberg, G.(ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1 World Scientific (1997)
Sangiorgi, D., Walker, D.: The π-calculus—A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Sassone, V., Sobociński, P.: Deriving bisimulation congruences: 2-categories vs precategories. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol. 2620, pp. 409–424. Springer, Heidelberg (2003)
Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311–320. IEEE Computer Society Press, Los Alamitos (2005)
Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274(1-2), 183–230 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
König, B. (2007). Deriving Bisimulation Congruences with Borrowed Contexts . In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds) Algebra and Coalgebra in Computer Science. CALCO 2007. Lecture Notes in Computer Science, vol 4624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73859-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73859-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73857-2
Online ISBN: 978-3-540-73859-6
eBook Packages: Computer ScienceComputer Science (R0)