In this paper, we investigate how rewriting systems and especially graph grammars as
operational models of parallel and distributed systems can be related to event structures as …

Actor Grammars are a model of actor systems based on graph rewriting. Computation
graphs model rewriting processes in actor grammars, and hence, computations in actor …

The aim of this chapter is to present an introduction to actor grammars and ESM systems,
and to point out along which lines a theory of processes can be developed for them. Actor …

In the paper we define grammars on a class of labeled, partially ordered hypergraphs, called
distributed systems. A distributed system models both the spatial and the temporal aspects …

Several formal concurrent semantics have been proposed for graph rewriting, a powerful
formalism for the specification of concurrent and distributed systems which generalizes P/T …

Context-dependent rewriting systems allow a higher degree of concurrency wrt context-
independent ones, since rewriting rules which apply in intersecting contexts and rewrite …

Actor grammars are a model of actor systems based on graph rewriting. Computation graphs
model rewriting processes in actor grammars, and hence, computations in actor systems. It …

The generalised term graph rewriting computational model is exploited to implement
concurrent languages based on Girard's Linear Logic (LL). In particular a fragment of LL is …

A model of processes of rewriting graphs is proposed in which concurrency and branching
can be represented. Operations on structures representing processes of rewriting graphs …

Actor systems are a model of massively parallel systems based on asynchronous message
passing. This paper presents a formalism for actor systems in the framework of graph …