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 225–239Cite as

Process specification and verification

  • Concurrency
  • Conference paper
  • First Online:

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

Abstract

Graph grammars provide a very convenient specification tool for distributed systems of processes. This paper addresses the problem how properties of such specifications can be proven. It shows a connection between algebraic graph rewrite rules and temporal (trace) logic via the graph expressions of [2]. Statements concerning the global behavior can be checked by local reasoning.

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. G. Agha: Concurrent Object-oriented Programming. Communications of the ACM 33(3), 125–141 (1990)

    Google Scholar 

  2. M. Bauderon, B. Courcelle: Graph Expressions and Graph Rewritings. Mathematical Systems Theory 20, 83–127 (1987)

    Google Scholar 

  3. P. Böhm, H.-R. Fonio, A. Habel: Amalgamation of Graph Transformations: A Synchronization Mechanism. Journal of Computer and System Sciences 34, 377–408 (1987)

    Google Scholar 

  4. P. Degano, U. Montanari: A Model for Distributed Systems Based on Graph Rewriting. Journal of the ACM 34(2), 411–449 (1987)

    Google Scholar 

  5. A. Habel, H.-J. Kreowski, C. Lautemann: A comparison of compatible, finite, and inductive graph properties. Theoretical Computer Science 110, 145–168 (1993)

    Google Scholar 

  6. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall 1985

    Google Scholar 

  7. F. Kröger: Temporal Logic of Programs. Springer 1987

    Google Scholar 

  8. R. Milner: Communication and Concurrency. Prentice Hall 1989

    Google Scholar 

  9. R. Milner, J. Parrow, D. Walker: A Calculus of Mobile Processes I & II. Information and Control 100, 1–77 (1992)

    Google Scholar 

  10. V. Nguyen, A. Demers, D. Gries, S. Owicki: Behavior: a Temporal Approach to Process Modelling. In: R. Parikh (Ed.): Logics of Programs. Lecture Notes in Computer Science 193 (1985)

    Google Scholar 

  11. G. Schied: Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und verteilte Regelsysteme. Dissertation. Arbeitsberichte des IMMD 25, 2, Universität Erlangen-Nürnberg 1992

    Google Scholar 

  12. B. Thomsen: Plain CHOCS A second generation calculus for higher order processes. Acta Informatica 30, 1–59 (1993)

    Google Scholar 

  13. J. Widom, D. Gries, F. B. Schneider: Trace-Based Network Proof Systems: Expressiveness and Completeness. ACM Transactions on Programming Languages and Systems 14(3), 396–416 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Johannes Gutenberg-Universität, Staudinger Weg 9, Postfach 3980, D-55099, Mainz, Germany

    Klaus Barthelmann

Authors
  1. Klaus Barthelmann
    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

Barthelmann, K. (1996). Process specification and verification. 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_90

Download citation

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

  • 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