Algebraic high-level net transformation systems
Abstract: "The concept of algebraic high-level net transformation systems combines two important lines of research recently introduced in the literature: Algebraic high-level nets, short AHL-nets, and high-level replacement systems, short HLR-systems. In both cases a categorical formulation of...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
Berlin
Techn. Univ. Berlin, Fachbereich 20 - Informatik
1993
|
| Schriftenreihe: | Forschungsberichte des Fachbereichs Informatik / Technische Universität Berlin
1993,12 |
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Zusammenfassung: | Abstract: "The concept of algebraic high-level net transformation systems combines two important lines of research recently introduced in the literature: Algebraic high-level nets, short AHL-nets, and high-level replacement systems, short HLR-systems. In both cases a categorical formulation of the corresponding theory has turned out to be highly important which is also a good basis for the integration of these concepts in this paper. AHL-nets combine Petri nets with algebraic specifications and provide a powerful specification technique for distributed systems including data types and processes. HLR-systems are transformation systems for high-level structures like graphs, hypergraphs, algebraic specifications and different kinds of Petri nets. The theory of HLR- systems -- formulated already in a categorical framework -- is applied in this paper to AHL-nets. This allows to build up AHL-nets from basic components and to transform the net structure using rules or productions in the sense of graph grammars. This concept is illustrated by extending the well-known example of 'dining philosophers'. We are able to show that AHL-net-transformation systems satisfy several important compatibility properties. On one hand we obtain a local Church-Rosser and Parallelism Theorem, well-known for graph grammars and recently generalized to HLR- systems. On the other hand we consider the constructions 'fusion' and 'union' for high-level structures, motivated by corresponding concepts for high-level Petri nets in the literature, and show compatibility of these constructions with derivations of HLR-systems in general and AHL-net- transformations in particular. This allows to analyse concurrency in AHL- nets not only on the token level but also on the level of transformations of the net structure." |
|---|---|
| Beschreibung: | Literaturverz. Bl. 45 - 47 |
| Beschreibung: | 47 Bl. graph. Darst. |