55 research outputs found
Composition of M,N-adhesive Categories with Application to Attribution of Graphs
This paper continues the work on M,N-adhesive categories and shows some important composition properties for these categories. We present a new concept of attributed graphs and show that the corresponding category is M,N-adhesive. As a consequence, we inherit all nice properties for M,N-adhesive systems such as the Local Church-Rosser Theorem, the Parallelism Theorem, and the Concurrency Theorem for this type of attributed graphs
Multi-amalgamation of rules with application conditions in M-adhesive categories
Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Amalgamation is a well-known concept for graph transformations that is used to model synchronised parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalisation of the operational semantics of statecharts and other visual modelling languages, where typed attributed graphs are used for multiple rules with nested application conditions. However, the theory of amalgamation for the double-pushout approach has so far only been developed on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, in the current paper we present the theory of amalgamation for M-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions. The two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem, which generalises the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronised parallelism. In order to apply the largest amalgamated rule, we use maximal matchings, which are computed according to the actual instance graph. The constructions are illustrated by a small but meaningful running example, while a more complex case study concerning the firing semantics of Petri nets is presented as an introductory example and to provide motivation
Multi-amalgamation of rules with application conditions in M-adhesive categories
Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Amalgamation is a well-known concept for graph transformations that is used to model synchronised parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalisation of the operational semantics of statecharts and other visual modelling languages, where typed attributed graphs are used for multiple rules with nested application conditions. However, the theory of amalgamation for the double-pushout approach has so far only been developed on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, in the current paper we present the theory of amalgamation for M-adhesive categories, which form a slightly more general framework than (weak) adhesive HLR categories, for a bundle of rules with (nested) application conditions. The two main results are the Complement Rule Theorem, which shows how to construct a minimal complement rule for each subrule, and the Multi-Amalgamation Theorem, which generalises the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronised parallelism. In order to apply the largest amalgamated rule, we use maximal matchings, which are computed according to the actual instance graph. The constructions are illustrated by a small but meaningful running example, while a more complex case study concerning the firing semantics of Petri nets is presented as an introductory example and to provide motivation
Basic Results for Two Types of High-Level Replacement Systems1 1Research partially supported by the European Community under TMR Network GETGRATS and the ESPRIT Working Group APPLIGRAPH.
AbstractThe general idea of high-level replacement systems is to generalize the concept of graph transformation systems and graph grammars from graphs to all kinds of structures which are of interest in Computer Science and Mathematics. Within the algebraic approach of graph transformation this is possible by replacing graphs, graph morphisms, and pushouts (gluing) of graphs by objects, morphisms, and pushouts in a suitable category. Of special interest are categories for all kinds of labelled and typed graphs, hypergraphs, algebraic specifications and Petri nets. In this paper, we review the basic results for high-level replacement systems in the algebraic double-pushout approach in the symmetric case, where both rule morphisms belong to a distinguished class
M
. Moreover we present for the first time the asymmetric type of high-level replacement systems, where only the left rule morphism
K
→
L
belongs to
M
Manipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church–Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of M-adhesive categories, where M-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules
Local Confluence for Rules with Nested Application Conditions based on a New Critical Pair Notion
Local confluence is an important property in many rewriting systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper however, we consider rules with more general application conditions - also called nested application conditions - that are known to be equivalent to finite first-order graph conditions. The classical critical pair notion denotes conflicting transformations in a minimal context satisfying the application conditions. This is no longer true for combinations of positive and negative application conditions - an important special case of nested ones - where we allow that critical pairs do not satisfy the application conditions. This leads to a new notion of critical pairs which allows to formulate and prove a Local Confluence Theorem for rules with nested application conditions in the framework of adhesive rewriting systems based on the DPO-approach. It builds on a new Embedding Theorem and Completeness Theorem for critical pairs based on rules with nested application conditions. We demonstrate this new theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions
Expressiveness of graph conditions with variables
Graph conditions are very important for graph transformation systems and graph programs in a large variety of application areas. Nevertheless, non-local graph properties like ``there exists a path'', ``the graph is connected'', and ``the graph is cycle-free'' are not expressible by finite graph conditions. In this paper, we generalize the notion of finite graph conditions, expressively equivalent to first-order formulas on graphs, to finite \HR^+ graph conditions, i.e., finite graph conditions with variables where the variables are place-holders for graphs generated by a hyperedge replacement system. We show that graphs with variables and replacement morphisms form a weak adhesive HLR category. We investigate the expressive power of \HR^+ graph conditions and show that finite \HR^+ graph conditions are more expressive than monadic second-order graph formulas
- …