منابع مشابه
Net Refinement by Pullback Rewriting
The notion of pullback rewriting has been developed recently as a category theoretical framework for vertex replacement in graphs. Here, the technique is presented based on net morphisms, yielding a well-deened mechanism which is closely related to pullback rewriting in hypergraphs. Finally, a net reenement operation modifying the context of the reened transition is characterized in terms of pu...
متن کاملA Uniform Approach to Graph Rewriting: The Pullback Approach
Most of the works in the theory of graph rewriting can be put into two main categories : edge (or hyperedge) rewriting and node rewriting. Each has been described by a speciic formalism, both have given rise to many signiicant developments and many works have been devoted to the comparison of both approaches. In this paper, we describe a new categorical formalism, which provides a common framew...
متن کاملParallel rewriting of graphs through the pullback approach
We continue here the development of our description of the pullback approach to graph rewriting-already shown to encompass both the NCE and the double-pushout approach, by describing parallel application of rewriting rules. We show that this new framework provides a genuine deenition of parallel rewriting (parallel application of several rewriting rules at several diierent places in the graph i...
متن کاملRewriting Calculus: Foundations and Applications
Composition du jury Président : Guy Cousineau, Professeur, Université Denis Diderot Paris VII, France Rapporteurs : Nachum Dershowitz, Professeur, Université de Tel Aviv, Israel Thérèse Hardin, Professeur, Université Pierre et Marie Curie Paris VI, France François Lamarche, Directeur de recherche, INRIA, France Examinateurs : Alexander Bockmayr, Professeur, Université Henri Poincaré Nancy 1, Fr...
متن کاملInfinitary Rewriting--Theory and Applications
Infinitary rewriting generalises usual finitary rewriting by providing infinite reduction sequences with a notion of convergence. The idea of – at least conceptually – assigning a meaning to infinite derivations is well-known, for example, from lazy functional programming or from process calculi. Infinitary rewriting makes it possible to apply rewriting in order to obtain a formal model for suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00193-8