Results 241 to 250 of about 2,591 (261)
Some of the next articles are maybe not open access.
Graph rewriting as a computational model
1991Graph Rewriting can be viewed as a rather general framework which encompasses a variety of ‘New generation’ computational models, ranging from functional languages through logic languages of the commited choice variety to actor (object) languages.
D. L. McBurney, M. Ronan Sleep
openaire +2 more sources
Graph Rewriting in Span-Categories
2010There are three variations of algebraic graph rewriting, the double-pushout, the single-pushout, and the sesqui-pushout approach. In this paper, we show that all three approaches can be considered special cases of a general rewriting framework in suitable categories of spans over a graph-like base category.
openaire +1 more source
A Compass to Controlled Graph Rewriting
2019With the growing complexity and autonomy of software-intensive systems, abstract modeling to study and formally analyze those systems is gaining on importance. Graph rewriting is an established, theoretically founded formalism for the graphical modeling of structure and behavior of complex systems. A graph-rewriting system consists of declarative rules,
openaire +2 more sources
A calculus of concurrent graph-rewriting processes
Journal of Logical and Algebraic Methods in Programming, 2020Andrea Corradini +2 more
exaly
Pullback as a Generic Graph Rewriting Mechanism
Applied Categorical Structures, 2001Michel Bauderon
exaly
On the reachability of a version of graph-rewriting system
Information Processing Letters, 2009Kohji Tomita, Haruhisa Kurokawa
exaly
Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
Applied Categorical Structures, 1999Ugo Montanari
exaly
Relating graph and term rewriting via Böhm models
Applicable Algebra in Engineering, Communications and Computing, 1996Zena Matilde Ariola
exaly