Composition and decomposition of DPO transformations with borrowed context

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

Volumn 4178 LNCS, Issue , 2006, Pages 153-167

  Baldan, Paolo ^a   Ehrig, Hartmut ^b   König, Barbara ^c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

BORROWED CONTEXTS; DOUBLE-PUSHOUT (DPO) TRANSFORMATIONS; LOCAL STATES; TRANSITION SYSTEM;

CONTEXT FREE GRAMMARS;

EID: 33750233431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841883_12     Document Type: Conference Paper

References (12)

1. P. Baldan, H. Ehrig, and B. König. Composition and decomposition of DPO transformations with borrowed contexts. Technical report, Universität Duisburg-Essen, 2006.
2. H. P. Barendregt. The Lambda Calculus - its Syntax and Semantics, volume 103 of Studies in Logic and Foundations of Mathematics. North-Holland, 1984.
3. F. Bonchi, F. Gadducci, and B. König. Process bisimulation via a graphical encoding. In Proc. of ICGT '06. Springer, 2006. LNCS, to appear.
4. L. Cardelli and A. D. Gordon. Mobile ambients. In Proc. of FoSSaCS '98, pages 140-155. Springer-Verlag, 1998. LNCS 1378.
5. 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.
6. H. Ehrig and B. König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FOSSACS '04, pages 151-166. Springer, 2004. LNCS 2987.
7. 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. World Scientific, 1999.
8. O. H. Jensen and R. Milner. Bigraphs and transitions. In Proc. of POPL 2003, pages 38-49. ACM, 2003.
9. S. Lack and P. Sobociński. Adhesive and quasiadhesive categories. RAIRO - Theoretical Informatics and Applications, 39(3), 2005.
10. J. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877.
11. R. Milner. The polyadic π-calculus: a tutorial. In Logic and Algebra of Specification. Springer-Verlag, Heidelberg, 1993.
12. V. Sassone and P. Sobociński. Reactive systems over cospans. In Proc. of LICS '05, pages 311-320. IEEE, 2005.