Автор |
KÖNIG, BARBARA |
Дата выпуска |
2002 |
dc.description |
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. |
Издатель |
Cambridge University Press |
Название |
Hypergraph construction and its application to the static analysis of concurrent systems Research supported by SFB 342 (subproject A3) of the DFG. |
DOI |
10.1017/S0960129501003486 |
Electronic ISSN |
1469-8072 |
Print ISSN |
0960-1295 |
Журнал |
Mathematical Structures in Computer Science |
Том |
12 |
Первая страница |
149 |
Последняя страница |
175 |
Аффилиация |
KÖNIG BARBARA; Technische Universität München |
Выпуск |
2 |