Results 221 to 230 of about 2,591 (261)
Some of the next articles are maybe not open access.
2022
We introduce a component model for graph rewriting that allows to model a system as a network of components with interfaces representing shared views of internal states and transformations. Their composition assembles a global view whose behaviour is equivalent to the synchronised distributed execution of local components in the network.
Reiko Heckel +2 more
openaire +3 more sources
We introduce a component model for graph rewriting that allows to model a system as a network of components with interfaces representing shared views of internal states and transformations. Their composition assembles a global view whose behaviour is equivalent to the synchronised distributed execution of local components in the network.
Reiko Heckel +2 more
openaire +3 more sources
EQUATIONAL TERM GRAPH REWRITING [PDF]
Fundamenta Informaticae, 1996 We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Specifically, a homomorphism is a functional bisimulation.
Zena M. Ariola, Jan Willem Klop
openaire +3 more sources
Graph expressions and graph rewritings
Mathematical Systems Theory, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Bauderon, Bruno Courcelle
openaire +2 more sources
An algebra of graphs and graph rewriting
2005In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes of monomorphisms in a category of graphs, which may be interpreted as graphs having both a concrete part and an abstract part (defined up to isomorphism). Morphisms between pa-graphs are pushout squares.
CORRADINI, ANDREA +1 more
openaire +1 more source
Pragmatic graph rewriting modifications [PDF]
Proceedings 1999 IEEE Symposium on Visual Languages, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph.
Peter J. Rodgers, Natalia Vidal
exaly +2 more sources
Transitive term graph rewriting [PDF]
Information Processing Letters, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R Banach
exaly +3 more sources
Extending Graph Rewriting for Refactoring
2004Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising approach towards the problem of program erosion. Nevertheless a solid theoretical foundation is still lacking.
van Eetvelde, Niels, Janssens, Dirk
openaire +3 more sources
1996
We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.
openaire +1 more source
We discuss some aspects of term graph rewriting based on systems of recursion equations. This is done for first-order signatures as well as lambda calculus. Also relations with infinitary rewriting are discussed.
openaire +1 more source
Graph rewriting systems with priorities
1990In this paper, we develop a new theory of attribute graph rewriting systems with priorities. This theory provides a very general tool for describing algorithms from classical graph theory, and for algorithms implemented on networks of communicating processors and distributed systems.
Billaud, Michel +3 more
openaire +3 more sources
Concurrent graph and term graph rewriting
1996Graph Rewriting Systems are a powerful formalism for the specification of parallel and distributed systems, and the corresponding theory is rich of results concerning parallelism and concurrency. I will review the main results of the theory of concurrency for the algebraic approach to graph rewriting, emphasizing the relationship with the theory of ...
openaire +3 more sources