Results 1 to 10 of about 2,442 (118)
Graph Rewriting Techniques in Engineering Design
Frontiers in Built Environment, 2022 Capturing human knowledge underlying the design and engineering of products has been among the main goals of computational engineering since its very beginning. Over the last decades, various approaches have been proposed to tackle this objective.
Jimmy Abualdenien +2 more
exaly +3 more sources
Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present strategic portgraph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs.
Maribel Fernández +2 more
doaj +1 more source
Modes of Convergence for Term Graph Rewriting [PDF]
Logical Methods in Computer Science, 2012 Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent.
Patrick Bahr
doaj +1 more source
Semantics-Preserving DPO-Based Term Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Term graph rewriting is important as "conceptual implementation" of the execution of functional programs, and of data-flow optimisations in compilers.
Wolfram Kahl, Yuhang Zhao
doaj +1 more source
Term Graph Rewriting and Parallel Term Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing.
Andrea Corradini, Frank Drewes
doaj +1 more source
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Thermodynamic graph-rewriting [PDF]
Logical Methods in Computer Science, 2015 We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy cost function ...
Vincent Danos +2 more
doaj +1 more source
PORGY: Strategy-Driven Interactive Transformation of Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 This paper investigates the use of graph rewriting systems as a modelling tool, and advocates the embedding of such systems in an interactive environment.
Oana Andrei +5 more
doaj +1 more source
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on ...
János Varga
doaj +1 more source