Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T23:04:07.911Z Has data issue: false hasContentIssue false
  • English
  • Français

Hypergraph construction and its application to the static analysis of concurrent systems

Published online by Cambridge University Press:  08 May 2002

BARBARA KÖNIG
BARBARA KÖNIG
Affiliation:
Fakultät für Informatik, Technische Universität München
Get access Rights & Permissions [Opens in a new window]

Abstract

We define a construction operation on hypergraphs based on a colimit and show that its expressiveness is equal to the graph expressions of Bauderon and Courcelle. We also demonstrate that by closing a set of rewrite rules under graph construction we obtain a notion of rewriting equivalent to the double-pushout approach of Ehrig. The usefulness of our approach for the compositional modelling of concurrent systems is then demonstrated by giving a semantics of process graphs (corresponding to a process calculus with mobility) and of Petri nets. We introduce on the basis if a hypergraph construction, a method for the static analysis of process graphs, related to type systems.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 12 , Issue 2 , April 2002 , pp. 149 - 175
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

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