Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Behaviour of elementary net systems
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Equivalence of computations in actor grammars
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Computation graphs for actor grammars
Journal of Computer and System Sciences
ESM Systems and the Composition of Their Computations
Proceedings of the International Workshop on Graph Transformations in Computer Science
Basic notions of actor grammars: A graph grammar model for actor computation
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
| Hi-index | 0.00 |
ESM systems are a graph-rewriting formalism for concurrent systems: a global system state is represented by a graph and a run of the system is described by a graph rewriting process. These rewriting processes are formally described by computation structures. It is demonstrated that the computation structures of an ESM system P may be viewed as the arrows of a category Cat comp(P) where objects are system states. This category generalizes the well-known notion of a transition system. From Cat comp(P) various more abstract semantics are derived, and for each of them a powerful composition operation on computations, generalizing both the sequential and parallel composition of computations, is defined.