Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Category theory for computing science
Category theory for computing science
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation
From rewrite rules to bisimulation congruences
Theoretical Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
A 2-Categorical Presentation of Term Graph Rewriting
CTCS '97 Proceedings of the 7th International Conference on Category Theory and Computer Science
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
Quasitoposes, quasiadhesive categories and artin glueing
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Adhesivity is not enough: local church-rosser revisited
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
M,N-adhesive transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
The recent interest in bisimulation congruences for reduction systems, stimulated by the research on general (often graphical) frameworks for nominal calculi, has brought forward many proposals for categorical formalisms where relevant properties of observational equivalences could be auto- matically verified. Interestingly, some of these formalisms also identified suitable categories where the standard tools and techniques developed for the double-pushout approach to graph transformation [A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel and M. Lowe, Algebraic approaches to graph transformation I: Basic concepts and double pushout approach, in: G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, I: Foundations, World Scientific, 1997, pp. 163-246] could be recast, thus providing a valid alternative to the High-Level Replacement Systems paradigm [H. Ehrig, A. Habel, H.-J. Kreowski and F. Parisi-Presicce, Parallelism and concurrency in highlevel replacement systems, Mathematical Structures in Computer Science 1 (1991) 361-404]. In this paper we consider the category of term graphs, and we prove that it (partly) fits in the general framework for adhesive categories, developed in [S. Lack, and P. Sobocinski, Adhesive categories, in: I. Walukiewicz, editor, Foundations of Software Science and Computation Structures, Lect. Notes in Comp. Sci. 2987 (2004), pp. 273-288, P. Sobocinski, ''Deriving bisimulation congruences from reduction systems'', Ph.D. thesis, BRICS, Department of Computer Science, University of Aaurhus (2004)], extended in [H. Ehrig, A. Habel, J. Padberg and U. Prange, Adhesive high-level replacement categories and systems, in: G. Engels and F. Parisi-Presicce, editors, Graph Transformation, Lect. Notes in Comp. Sci. (2004)] and applied to reduction systems in [V. Sassone, and P. Sobocinski, Congruences for contextual graph-rewriting, Technical Report RS-04-11, BRICS, Department of Computer Science, University of Aarhus (2004)]. The main technical achievement concerns the proof that the category of term graphs is actually quasi-adhesive, obtained by proving the existence of suitable Van Kampen squares.