Results 231 to 240 of about 2,591 (261)
Some of the next articles are maybe not open access.
Incremental Update for Graph Rewriting
2017Graph rewriting formalisms are well-established models for the representation of biological systems such as protein-protein interaction networks. The combinatorial complexity of these models usually prevents any explicit representation of the variables of the system, and one has to rely on stochastic simulations in order to sample the possible ...
Ehrhard, Thomas +2 more
openaire +3 more sources
Aspect Weaving with Graph Rewriting
2000This paper introduces GRS-based AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The corresponding class of AOP problems has a formal background since it inherits all features of graph rewrite systems such as criteria for termination, confluence, and unique normal forms.
Uwe Aßmann, Andreas Ludwig
openaire +1 more source
Sharing in the Graph Rewriting Calculus
2012The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures, with explicit sharing and cycles, rather than simple terms. We study a reduction strategy for the graph rewriting calculus which is intended to maintain the sharing in the terms as long as possible.
BALDAN, PAOLO, Clara Bertolissi
openaire +2 more sources
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science, 2007We propose a graphical implementation for (possibly recursive) processes of the π-calculus, encoding each process into a graph. Our implementation is sound and complete with respect to the structural congruence for the calculus: two processes are equivalent if and only if they are mapped into graphs with the same normal form.
openaire +1 more source
2018
Controlled graph rewriting enhances expressiveness of plain graph-rewriting systems (i.e., sets of graph-rewriting rules) by introducing additional constructs for explicitly controlling graph-rewriting rule applications. In this regard, a formal semantic foundation for controlled graph rewriting is inevitable as a reliable basis for tool-based ...
Géza Kulcsár +2 more
openaire +1 more source
Controlled graph rewriting enhances expressiveness of plain graph-rewriting systems (i.e., sets of graph-rewriting rules) by introducing additional constructs for explicitly controlling graph-rewriting rule applications. In this regard, a formal semantic foundation for controlled graph rewriting is inevitable as a reliable basis for tool-based ...
Géza Kulcsár +2 more
openaire +1 more source
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming, 2006We define a new class of rewrite systems operating over term-graphs. Our aim is twofold. First we propose to extend classical first-order rewrite rules in order to process easily data-structures with pointers (e.g., circular lists, doubly linked lists etc).
Ricardo Caferra +2 more
openaire +1 more source
Extending graph rewriting with copying
1994The notion of term graph rewrite system (TGRS) is extended with a lazy copying mechanism. By analyzing this mechanism, a confluence result is obtained for these so-called copy term graph rewrite systems (C-TGRS). Some ideas on the use of lazy copying in practice are presented.
Erik Barendsen, Sjaak Smetsers
openaire +1 more source
Complexity Analysis by Graph Rewriting
2010Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show that polynomial (innermost) runtime complexity of TRSs induces polytime computability of the functions defined.
Martin Avanzini, Georg Moser
openaire +1 more source
Parallel Admissible Graph Rewriting
1999We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in general whereas it is confluent in the case of weakly orthogonal term rewriting systems.
Rachid Echahed, Jean-Christophe Janodet
openaire +1 more source
Graph rewriting: A bibliographical guide
1995Graph rewriting is not presently a unified theory. There are numerous notions of graph rewriting and this diversity reflects the diversity of motivations. We offer a classification of the main definitions. A selected and annotated bibliography reviews recent and accessible papers and books.
openaire +2 more sources