MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Hypergraph construction and its application to the compositional modelling of concurrency (2000) [8 citations — 2 self]

Download:
Download as a PDF | Download as a PS
by Barbara Konig
In GRATRA 2000: Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems
ftp://flop.informatik.tu-muenchen.de/pub/theory/koenigb/co-limit-full.ps.gz
Add To MetaCart

Abstract:

Abstract. We define a construction operation on hypergraphs using a co-limit and show that its expressiveness concerning graph rewriting is equal to the graph expressions of Courcelle and the double-pushout approach of Ehrig. With an inductive way of representing graphs, graph rewriting arises naturally as a derived concept. The usefulness of our approach for the compositional modelling of concurrent systems is then shown by defining the semantics of a process calculus with mobility and of petri nets. 1

Citations

316 The polyadic -calculus: a tutorial – Milner - 1991
156 Petri nets are monoids – Meseguer, Montanari - 1990
126 The polyadic π-calculus: A tutorial – Milner - 1993
93 The polymorphic pi-calculus: Theory and implementation – Turner - 1996
69 Categories for Types – Crole - 1993
68 Graph expressions and graph rewritings – Bauderon, Courcelle - 1987
46 Hyperedge replacement: Grammars and languages – Habel - 1992
27 An inductive view of graph transformation – Gadducci, Heckel - 1997
24 Graph notation for concurrent combinators – Yoshida - 1995
16 Generating type systems for process graphs – König - 1999
11 Introduction to the algebraic theory of graphs – Ehrig - 1979
10 A Comparison between Petri-nets and Graph Grammars – Kreowski - 1981
8 Closed action calculi. Theoretical Computer Science (in association with the conference – Gardner - 1998
7 Description and Verification of Mobile Processes with Graph Rewriting Techniques – Konig - 1999
5 A graph grammar representation of nonsequential processes – Reisig - 1980
2 A bicategorical axiomatization of concurrent graph rewriting – Gadducci, Heckel, et al. - 1999