Deriving bisimulation congruences in the DPO approach to graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2987, Issue , 2004, Pages 151-166

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

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BISIMILARITY; BISIMULATION CONGRUENCES; BORROWED CONTEXTS; CATEGORY THEORY; DOUBLE PUSHOUT; GRAPH REWRITING; LABELLED TRANSITIONS; REACTION RULES;

COMPUTATION THEORY;

EID: 34547307993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_12     Document Type: Article

References (24)

1. Roberto Bruni, Ugo Montanari, and Vladimiro Sassone. Open ended systems, dynamic bisimulation and tile logic. In Proc. of IFIP TCS 2000. Springer, 2000. LNCS 1872.
2. A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, and M. Löwe. Algebraic approaches to graph transformation-part I: Basic concepts and double pushout approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, chapter 3. World Scientific, 1997.
3. H. Ehrig. Bigraphs meet double pushouts. EATCS Bulletin, 78:72-85, October 2002.
4. H. Ehrig, M. Gajewsky, and F. Parisi-Presicce. High-level replacement systems with applications to algebraic specifications and Petri nets. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution, chapter 6, pages 341-400. World Scientific, 1999.
5. H. Ehrig, R. Heckel, M. Korff, M. Löwe, L. Ribeiro, A. Wagner, and A. Corradini. Algebraic approaches to graph transformation-part II: Single pushout approach and comparison with double pushout approach. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, chapter 4. World Scientific, 1997.
6. . Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. Technical report, Universität Stuttgart, 2004. to appear.
7. F. Gadducci and R. Heckel. An inductive view of graph transformation. In Recent Trends in Algebraic Development Techniques, 12th International Workshop, WADT '97, pages 223-237. Springer-Verlag, 1997. LNCS 1376.
8. F. Gadducci and U. Montanari. A concurrent graph semantics for mobile ambients. In S. Brookes and M. Mislove, editors, Proceedings of the 17th MFPS, volume 45 of Electronic Notes in Computer Science. Elsevier Science, 2001.
9. F. Gadducci and U. Montanari. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science, 285(2):319-358, 2002.
10. Ole Høgh Jensen and Robin Mimer. Bigraphs and transitions. In Proc. of POPL 2003, pages 38-49. ACM, 2003.
11. Barbara König. A graph rewriting semantics for the polyadic π-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops '00, pages 451-458. Carleton Scientific, 2000.
12. Stephen Lack and Pawel Sobocinski. Adhesive categories. In Proc. of FOSSACS '04, LNCS. Springer, 2004. to appear.
13. James J. Leifer. Operational congruences for reactive systems. PhD thesis, University of Cambridge Computer Laboratory, September 2001.
14. James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877.
15. Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.
16. Robin Milner. Bigraphical reactive systems. In Proc. of CONCUR '01, pages 16-35. Springer-Verlag, 2001. LNCS 2154.
17. Robin Milner and Davide Sangiorgi. Barbed bisimulation. In Proc. of ICALP '92. Springer-Verlag, 1992. LNCS 623.
18. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, 16:171-196, 1992.
19. Ugo Montanari and Marco Pistore. Concurrent semantics for the π-calculus. Electronic Notes in Theoretical Computer Science, 1, 1995.
20. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations, volume 1. World Scientific, 1997.
21. Davide Sangiorgi. On the proof method for bisimulation. In Proc. of MFCS '95 (Mathematical Foundations of Computer Science), pages 479-488. Springer, 1995. LNCS 969.
22. Davide Sangiorgi and David Walker. The π-calculus-A Theory of Mobile Processes. Cambridge University Press, 2001.
23. Vladimiro Sassone and Pawel Sobocinski. Deriving bisimulation congruences: 2categories vs precategories. In Proc. of FoSSaCS 2003, pages 409-424, 2003.
24. Peter Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1-2):183-230, 2002.