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

Authors:
Barbara König
Affiliations:
Fakultät für Informatik, Technische Universität München
Venue:
Mathematical Structures in Computer Science
Year:
2002

Citing 7
Cited 0

Petri nets are moniods

Information and Computation
Graph processes

Fundamenta Informaticae - Special issue on graph transformations
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Graph Notation for Concurrent Combinators

TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
An inductive view of graph transformation

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Introduction to the Algebraic Theory of Graph Grammars (A Survey)

Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
A Comparison Between Petri-Nets and Graph Grammars

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.