Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

Mathematical Structures in Computer Science

Volumn 16, Issue 6, 2006, Pages 1133-1163

  Ehrig, Hartmut ^a   König, Barbara ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845660312     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012950600569X     Document Type: Article

References (34)

1. Baldan, P., Corradini, A. and Montanari, U. (2002) Bisimulation equivalences for graph grammars. In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg. Springer-Verlag Lecture Notes in Computer Science 2300 158-190.
2. Baldan, P., Ehrig, H. and König, B. (2006) Composition and decomposition of DPO transformations with borrowed context. In: Proc. of ICGT '06 (to appear).
3. Bonchi, F., König, B. and Montanari, U. (2006) Saturated semantics for reactive systems. In: Proc. of ICGT '06 (to appear).
4. Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R. and Löwe, M. (1997) 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, Volume 1 : Foundations, Chapter 3, World Scientific.
5. Ehrig, H. (2002) Bigraphs meet double pushouts. EATCS Bulletin 78 72-85.
6. Ehrig, H., Habel, A., Padberg, J. and Prange, U. (2004) Adhesive high-level replacement categories and systems. In: Proc. of ICGT '04 (to appear).
7. Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A. and Corradini, A. (1997) Algebraic approaches to graph transformation - part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1 : Foundations, Chapter 4, World Scientific.
8. Ehrig, H., Pfender, M. and Schneider, H. (1973) Graph grammars: An algebraic approach. In: Proc. 14th IEEE Symp. on Switching and Automata Theory 167-180.
9. Gadducci, F. and Heckel, R. (1997) An inductive view of graph transformation. In: Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT '97. Springer-Verlag Lecture Notes in Computer Science 1376 223-237.
10. Gadducci, F. and Montanari, U. (2001) A concurrent graph semantics for mobile ambients. In: Brookes, S. and Mislove, M. (eds.) Proceedings of the 17th MFPS. Electronic Notes in Computer Science 45.
11. Gadducci, F. and Montanari, U. (2002) Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science 285 (2) 319-358.
12. Jensen, O. H. (to appear) Bigraphs, Ph.D. thesis, University of Aalborg.
13. Jensen, O. H. and Milner, R. (2003) Bigraphs and transitions. In: Proc. of POPL 2003, ACM 38-49.
14. König, B. (2000) A graph rewriting semantics for the polyadic π-calculus. In: Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops '00, Carleton Scientific 451-458.
15. König, B. and Montanari, U. (2001) Observational equivalence for synchronized graph rewriting with mobility. In: Proc. of TACS '01. Springer-Verlag Lecture Notes in Computer Science 2215 145-164.
16. Lack, S. and Sobociński, P. (2004) Adhesive categories. In: Proc. of FOSSACS '04. Springer-Verlag Lecture Notes in Computer Science (to appear).
17. Lack, S. and Sobociński, P. (2005) Adhesive and quasiadhesive categories. RAIRO - Theoretical Informatics and Applications 39 (3).
18. Leifer, J. J. (2001) Operational congruences for reactive systems, Ph.D. thesis, University of Cambridge Computer Laboratory.
19. Leifer, J. J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. In: Proc. of CONCUR 2000. Springer-Verlag Lecture Notes in Computer Science 1877.
20. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer-Verlag.
21. Milner, R. (1999) Communicating and Mobile Systems: the π-Calculus, Cambridge University Press.
22. Milner, R. (2001) Bigraphical reactive systems. In: Proc. of CONCUR '01. Springer-Verlag Lecture Notes in Computer Science 2154 16-35.
23. Milner, R. and Sangiorgi, D. (1992a) Barbed bisimulation. In: Proc. of ICALP '92. Springer-Verlag Lecture Notes in Computer Science 623.
24. Milner, R. and Sangiorgi, D. (1992b) Techniques of weak bisimulation up-to. In: Proc. of CONCUR '92. Springer-Verlag Lecture Notes in Computer Science 630.
25. Montanari, U. and Pistore, M. (1995) Concurrent semantics for the π-calculus. Electronic Notes in Theoretical Computer Science 1.
26. Pierce, B. C. (1991) Basic Category Theory for Computer Scientists (Foundations of Computing), MIT Press.
27. Rozenberg, G. (editor) (1997) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific.
28. Sangiorgi, D. (1995) On the proof method for bisimulation. In: Proc. of MFCS '95 (Mathematical Foundations of Computer Science). Springer-Verlag Lecture Notes in Computer Science 969 479-488.
29. Sangiorgi, D. and Walker, D. (2001) The π-calculus - A Theory of Mobile Processes, Cambridge University Press.
30. Sassone, V. and Sobociński, P. (2003) Deriving bisimulation congruences: 2-categories vs precategories. In: Proc. of FoSSaCS 2003. Springer-Verlag Lecture Notes in Computer Science 2620 409-424.
31. Sassone, V. and Sobociński, P. (2004) Congruences for contextual graph-rewriting. Technical Report RS-04-11, BRICS.
32. Sassone, V. and Sobociński, P. (2005) Reactive systems over cospans. In: Proc. LICS '05, IEEE 311-320.
33. Sewell, P. (2002) From rewrite rules to bisimulation congruences. Theoretical Computer Science 274 (1-2) 183-230.
34. Sobociński, P. (2004) Special PB-PO property in adhesive cats (note).