Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1994: Graph Grammars and Their Application to Computer Science pp 271–287Cite as

The decomposition of ESM computations

  • Concurrency
  • Conference paper
  • First Online:

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

Abstract

The work presented continues the exploration of the value of ESM systems as a model of concurrent computation. In [4] and [5] a true concurrent semantics for these systems is presented, where concurrent histories are represented by process objects, called computation structures. In this paper it is shown that, if one refines the notion of a computation structure in a suitable way, then each computation structure can be decomposed according to an arbitrary partitioning of the system into subsets of rules. As a result the semantics is compositional with respect to the union of sets of rules. An application to some variants of Petri nets is sketched.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Corradini, H.Ehrig, M.Löwe, U.Montanari and F.Rossi, Abstract Graph derivations in the Double-Pushout Approach, in Graph-Transformations in Computer Science, Lecture Notes in Computer Science, vol. 776, Springer-Verlag, Berlin, 1994, 86–103.

    Google Scholar 

  2. C. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  3. M. Koutny, J. Esparza and E. Best, Operational semantics for the Petri box calculus, in CONCUR '94, Lecture Notes in Computer Science, vol. 836, Springer-Verlag, Berlin, 1994, 210–225.

    Google Scholar 

  4. D. Janssens, M.Lens and G.Rozenberg, Computation Graphs for Actor Grammars, Journal of Computer and System Sciences, 46 (1993), 60–90.

    Google Scholar 

  5. D. Janssens, ESM Systems and the Composition of Their Computations, in Graph-Transformations in Computer Science, Lecture Notes in Computer Science, vol. 776, Springer-Verlag, Berlin, 1994, 203–217.

    Google Scholar 

  6. D. Janssens and T. Mens, Abstract semantics for ESM systems, Fundamenta Informaticae, to appear (also available as: UIA report 95-04, dept. of Math. and Comp. Sci., University of Antwerp).

    Google Scholar 

  7. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  8. W. Reisig, Petri Nets, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Antwerp - UIA, Universiteitsplein 1, B-2610, Wilrijk, Belgium

    D. Janssens

Authors
  1. D. Janssens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janssens, D. (1996). The decomposition of ESM computations. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_93

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_93

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation