Results 31 to 40 of about 2,591 (261)
In-place Graph Rewriting with Interaction Nets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of an algorithm ...
Ian Mackie, Shinya Sato
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2023 Star to mesh transformations are well-known in electrical engineering, and are reminiscent of local complementation for graph states in qudit stabilizer quantum mechanics.
Cockett, Robin +2 more
doaj +1 more source
Concurrent Rewriting for Graphs with Equivalences [PDF]
, 2006 Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to coalesce some parts of the graph. This latter feature forbids the development of a satisfactory concurrent semantics for rewrites (intended as a partial order description of
Baldan, Paolo +2 more
openaire +4 more sources
Typed lambda-terms in categorical attributed graph transformation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules.
Bertrand Boisvert +2 more
doaj +1 more source
Emergence of Minkowski Spacetime by Simple Deterministic Graph Rewriting
Universe, 2022 The causal set program and the Wolfram physics project leave open the problem of how a graph that is a (3+1)-dimensional Minkowski spacetime according to its simple geodesic distances could be generated solely from simple deterministic rules.
Gabriel Leuenberger
doaj +1 more source
Interactions between Causal Structures in Graph Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that explains how ...
Ioana Cristescu +2 more
doaj +1 more source
Theoretical Computer Science, 1987 \textit{J. C. Raoult} [ibid. 32, 1-24 (1984; Zbl 0551.68065)] has given a description of graph rewriting. His description is operational, despite the similarity which his constructions have to the category-theoretic concept of a pushout. We describe a modification to Raoult's description of graph rewriting which allows the reduction of a redex to be ...
openaire +4 more sources
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The general form of safe recursion (or ramified recurrence) can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost ...
Naohi Eguchi
doaj +1 more source
Theoretical Computer Science, 1984 This paper deals with rewriting of directed ordered graphs over a graded alphabet G. The author shows that if graphs are represented by vertices and edges direct derivations accordin to \textit{H. Ehrig}, \textit{M. Pfender}, and \textit{H. J. Schneider} [Graph Grammars: an algebraic approach, Proc. 14th Annual Conf. Switching Automata Theory, 167-180 (
openaire +4 more sources
Confluence of Graph Rewriting with Interfaces [PDF]
, 2017 For terminating double-pushout DPO graph rewriting systems confluence is, in general, undecidable. We show that confluence is decidable for an extension of DPO rewriting to graphs with interfaces. This variant is important due to it being closely related to rewriting of string diagrams.
Filippo Bonchi +4 more
openaire +6 more sources