The category of typed graph grammars and its adjunctions with categories of derivations

Corradini, Andrea; Ehrig, Hartmut; Lowe, M. J. S.; Montanari, Ugo; Padberg, Julia

doi:10.1007/3-540-61228-9_79

Cited by 32 publications

(42 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following [6], we use forward and backward retyping functors to deal with graphs over different type graphs. A graph morphism f : TG → TG induces a forward retyping functor f > : Graph TG → Graph TG , with f > (g 1 ) = f • g 1 and f > (k : g 1 → g 2 ) = k by composition, as shown in the diagram in Figure 3(a).…”

Section: Typed Graph Transformation Systemsmentioning

confidence: 99%

See 1 more Smart Citation

Amalgamation of domain specific languages with behaviour

Durán

Moreno-Delgado

Orejas

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Domain-specific languages (DSLs) become more useful the more specific they are to a particular domain. The resulting need for developing a substantial number of DSLs can only be satisfied if DSL development can be made as efficient as possible. One way in which to address this challenge is by enabling the reuse of (partial) DSLs in the construction of new DSLs. Reuse of DSLs builds on two foundations: a notion of DSL composition and theoretical results ensuring the safeness of composing DSLs with respect to the semantics of the component DSLs.Given a graph-grammar formalisation of DSLs, in this paper, we build on graph transformation system morphisms to define parameterized DSLs and their instantiation by an amalgamation construction. Results on the protection of the behaviour along the induced morphisms allow us to safely reuse and combine definitions of DSLs to build more complex ones. We illustrate our proposal in e-Motions for a DSL for productionline systems and three independent DSLs for describing non-functional properties, namely response time, throughput, and failure rate.

show abstract

Section: Typed Graph Transformation Systemsmentioning

confidence: 99%

“…In our work, we build on a graph-grammar [6,52,16] formalisation of DSLs and on graph transformation system (GTS) morphisms to define composition operations on DSLs. Specifically, we define parameterized GTSs, that is, GTSs which have other GTSs as parameters.…”

Section: Introductionmentioning

confidence: 99%

Amalgamation of domain specific languages with behaviour

Durán

Moreno-Delgado

Orejas

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…Following [5,22], we use forward and backward retyping functors to deal with graphs over different type graphs. A graph morphism f : TG → TG induces a forward retyping functor f > : Graph TG → Graph TG , with f > (g 1 ) = f • g 1 and f > (k : g 1 → g 2 ) = k by composition, as shown in the diagram in Figure 9(a).…”

Section: G1mentioning

confidence: 99%

“…Different approaches exist for modularisation in the context of the graph-grammar formalism [5,40,12]. All of them have followed the tradition of modules inspired by the notion of algebraic specification module [15].…”

Section: Introductionmentioning

confidence: 99%

Behaviour Protection in Modular Rule-Based System Specifications

Durán

Orejas

Zschaler

2013

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. Model-driven engineering (MDE) and, in particular, the notion of domain-specific modelling languages (DSMLs) is an increasingly popular approach to systems development. DSMLs are particularly interesting because they allow encoding domain-knowledge into a modelling language and enable full code generation and analysis based on high-level models. However, as a result of the domain-specificity of DSMLs, there is a need for many such languages. This means that their use only becomes economically viable if the development of new DSMLs can be made efficient. One way to achieve this is by reusing functionality across DSMLs. On this background, we are working on techniques for modularising DSMLs into reusable units. Specifically, we focus on DSMLs whose semantics are defined through in-place model transformations. In this paper, we present a formal framework of morphisms between graph-transformation systems (GTSs) that allow us to define a novel technique for conservative extensions of such DSMLs. In particular, we define different behaviour-aware GTS morphisms and prove that they can be used to define conservative extensions of a GTS.

show abstract

“…This is essential to provide a characterisation of some interesting constructions with universal properties, as shown in Section 5. We shall use a variant of the morphisms in [6,3], where the type graphs are related by a partial morphism rather than by an arbitrary span.…”

mentioning

confidence: 99%

Graph Transactions as Processes

Baldan

Corradini

Foss

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Transactional graph transformation systems (t-gtss) have been recently proposed as a mild extension of the standard dpo approach to graph transformation, equipping it with a suitable notion of atomic execution for computations. A typing mechanism induces a distinction between stable and unstable items, and a transaction is defined as a shift-equivalence class of computations such that the starting and ending states are stable and all the intermediate states are unstable.The paper introduces an equivalent, yet more manageable definition of transaction based on graph processes. This presentation is used to provide a universal characterisation for the class of transactions of a given t-gts. More specifically, we show that the functor mapping a t-gts to a graph transformation system having as productions exactly the transactions of the original t-gts is the right adjoint to an inclusion functor.

show abstract

The category of typed graph grammars and its adjunctions with categories of derivations

Cited by 32 publications

References 9 publications

Amalgamation of domain specific languages with behaviour

Amalgamation of domain specific languages with behaviour

Behaviour Protection in Modular Rule-Based System Specifications

Graph Transactions as Processes

Contact Info

Product

Resources

About