Actor grammars
From MaRDI portal
Publication:3833641
DOI10.1007/BF02088293zbMath0677.68082OpenAlexW4234522786MaRDI QIDQ3833641
D. Jannssens, Grzegorz Rozenberg
Publication date: 1989
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02088293
Related Items
ESM systems and the composition of their computations, Single pushout transformations of equationally defined graph structures with applications to actor systems, Semantics of full statecharts based on graph rewriting, On relating rewriting systems and graph grammars to event structures, Concurrent graph and term graph rewriting, A Graph Transformation View on the Specification of Applications using Mobile Code* *Research partially supported by project ForMOS (Métodos Formais para Código Móvelem Sistemas Abertos) - grant CNPq 520269/98-5, by the Research Training Network GET-GRATS (General Theory of Graph Transformation Systems), and by the MURST project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., Conditional rewriting logic as a unified model of concurrency, A graph rewriting framework for Statecharts semantics, Equivalence of computations in actor grammars, Computation graphs for actor grammars
Cites Work
- Petri nets: applications and relationships to other models of concurrency. Advances in Petri nets 1986, Part II. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Semantic preserving translations
- Unnamed Item
- Unnamed Item
- Unnamed Item