Graph grammar-based description of object-based systems

  • D. Janssens
  • G. Rozenberg
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 489)


Actor grammars are a model of actor systems based on graph rewriting. Using this model, the problem of understanding the dynamic behaviour of actor systems may be translated into the problem of understanding rewriting processes in actor grammars. To this aim, two ways of describing such rewriting processes are introduced: computation graphs and structured transformations. While computation graphs take into account the internal structure of a rewriting process, structured transformations describe only the external effect of a rewriting process. The relationship between both notions is investigated.


Actor systems Graph grammars Concurrency Processes 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    G.A. Agha, Actors: A Model of Concurrent Computation in Distributed Systems, M.I.T. Press, Cambridge, MA, 1986.Google Scholar
  2. [C]
    W.D. Clinger, Foundations of Actor Semantics, Ph.D. Thesis, Massachusetts Institute of Technology, 1981. Available as Technical Report 633, AI Lab, Massachusetts Institute of Technology.Google Scholar
  3. [E]
    H. Ehrig, Introduction to the Algebraic Approach of Graph Grammars, in [ENRR], 3–14.Google Scholar
  4. [ELR]
    J. Engelfriet, G. Leih, and G. Rozenberg, Net-Based Description of Parallel Object-oriented Systems, or POTs and POPs, in this volume.Google Scholar
  5. [ENRR]
    H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, eds., Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science, Vol. 291, Springer-Verlag, Berlin, 1987.Google Scholar
  6. [He]
    C. Hewitt, Viewing Control Structures as Patterns of Passing Messages, J. Artificial Intel., 8 (1977), 323–364.Google Scholar
  7. [HB]
    C. Hewitt and H. Baker, Laws for Communicating Parallel Processes, Proc. IFIP 77, Toronto, 1977, 987–992.Google Scholar
  8. [JR]
    D. Janssens and G. Rozenberg, Actor Grammars, Math. Systens Theory, 22 (1989), 75–107.Google Scholar
  9. [M]
    J. Messeguer, Rewriting as a Unified Model of Concurrency, Technical Report SRI-CSL 90-02, Stanford Research International, Computer Science Laboratory, Menlo Park, 1990.Google Scholar
  10. [NRT]
    M. Nielsen, G. Rozenberg, and P.S. Thiagarajan, Elementary Transition Systems, Dept. of Computer Science, University of Leiden, Techn. Report 90–13, 1990.Google Scholar
  11. [R]
    G. Rozenberg, Behaviour of Elementary Net Systems, Advances in Petri Nets 1986, Part 1, Lecture Notes in Computer Science, Vol. 254, Springer-Verlag, Berlin, 1987, 60–94.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • D. Janssens
    • 1
  • G. Rozenberg
    • 2
  1. 1.Department of Mathematics and Computer ScienceVrije Universiteit BrusselBrusselsBelgium
  2. 2.Department of Computer ScienceLeiden UniversityLeidenThe Netherlands

Personalised recommendations