Skip to main content

Graph grammar-based description of object-based systems

  • Technical Contributions
  • Conference paper
  • First Online:
Foundations of Object-Oriented Languages (REX 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 489))

  • 127 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G.A. Agha, Actors: A Model of Concurrent Computation in Distributed Systems, M.I.T. Press, Cambridge, MA, 1986.

    Google Scholar 

  2. 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. H. Ehrig, Introduction to the Algebraic Approach of Graph Grammars, in [ENRR], 3–14.

    Google Scholar 

  4. 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. 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. C. Hewitt, Viewing Control Structures as Patterns of Passing Messages, J. Artificial Intel., 8 (1977), 323–364.

    Google Scholar 

  7. C. Hewitt and H. Baker, Laws for Communicating Parallel Processes, Proc. IFIP 77, Toronto, 1977, 987–992.

    Google Scholar 

  8. D. Janssens and G. Rozenberg, Actor Grammars, Math. Systens Theory, 22 (1989), 75–107.

    Google Scholar 

  9. 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. 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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. W. de Bakker W. P. de Roever G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janssens, D., Rozenberg, G. (1991). Graph grammar-based description of object-based systems. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Foundations of Object-Oriented Languages. REX 1990. Lecture Notes in Computer Science, vol 489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019449

Download citation

  • DOI: https://doi.org/10.1007/BFb0019449

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53931-5

  • Online ISBN: 978-3-540-46450-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics