Skip to main content
SpringerLink
Log in

A General Framework for Types in Graph Rewriting

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

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

Abstract

A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type graph is invariant under reduction, but still contains meaningful behaviour information. We present conditions, a type system for graph rewriting should satisfy, and a methodology for proving these conditions. In two case studies it is shown how to incorporate existing type systems (for the polyadic π-calculus and for a concurrent object-oriented calculus) into the general framework.

Research supported by SFB 342 (subproject A3) of the DFG.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3/4):241–265, 1996.

    MATH  MathSciNet  Google Scholar 

  2. H. Ehrig. Introduction to the algebraic theory of graphs. In Proc. 1st International Workshop on Graph Grammars, pages 1–69. Springer-Verlag, 1979. LNCS 73.

    Google Scholar 

  3. H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.

    Google Scholar 

  4. F. Gadducci and U. Montanari. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science, 2000. to appear.

    Google Scholar 

  5. Philippa Gardner. Closed action calculi. Theoretical Computer Science (in association with the conference on Mathematical Foundations in Programming Semantics), 1998.

    Google Scholar 

  6. Annegret Habel. Hyperedge Replacement: Grammars and Languages. Springer-Verlag, 1992. LNCS 643.

    MATH  Google Scholar 

  7. Masahito Hasegawa. Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, University of Edingburgh, 1997. available in Springer Distinguished Dissertation Series.

    Google Scholar 

  8. Kohei Honda. Composing processes. In Proc. of POPL’96, pages 344–357. ACM, 1996.

    Google Scholar 

  9. Atsushi Igarashi, Benjamin Pierce, and Philip Wadler. Featherweight Java: A core calculus for Java and GJ. In Proc. of OOPSLA 1999, 1999.

    Google Scholar 

  10. Barbara König. Generating type systems for process graphs. In Proc. of CONCUR’ 99, pages 352–367. Springer-Verlag, 1999. LNCS 1664.

    Google Scholar 

  11. Barbara König. A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universität München, 2000.

    Google Scholar 

  12. Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops 2000, pages 451–458. Carleton Scientific, 2000.

    Google Scholar 

  13. Barbara König. Hypergraph construction and its application to the compositional modelling of concurrency. In GRATRA 2000: Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems, 2000.

    Google Scholar 

  14. Yves Lafont. Interaction nets. In Proc. of POPL’ 90, pages 95–108. ACM Press, 1990.

    Google Scholar 

  15. James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877.

    Google Scholar 

  16. José Meseguer. Rewriting logic as a semantic framework for concurrency: A progress report. In Concurrency Theory, pages 331–372. Springer-Verlag, 1996. LNCS 1119.

    Google Scholar 

  17. Robin Milner. The polyadic π-calculus: a tutorial. In F. L. Hamer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, Heidelberg, 1993.

    Google Scholar 

  18. Robin Milner. Calculi for interaction. Acta Informatica, 33(8):707–737, 1996.

    Article  MathSciNet  Google Scholar 

  19. Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Proc. of LICS’ 93, pages 376–385, 1993.

    Google Scholar 

  20. David Walker. Objects in the π-calculus. Information and Computation, 116:253–271, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  21. Nobuko Yoshida. Graph notation for concurrent combinators. In Proc. of TPPP’ 94. Springer-Verlag, 1994. LNCS 907.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Technische Universität München, München

    Barbara König

Authors
  1. Barbara König
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

König, B. (2000). A General Framework for Types in Graph Rewriting. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41413-1

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation