Pair grammars, graph languages and string-to-graph translations

Pratt, Terrence W.

doi:10.1016/s0022-0000(71)80016-8

Cited by 118 publications

(41 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, one could consider graph tuple transformation where some relations (like morphisms) can be explicitly specified between the different graphs of a tuple. (4) Apart from generalizing the concept of typed transformation units, a comparison with similar concepts such as pair grammars [14] and triple grammars [16] is needed. (5) Finally, case studies of typed units should also be worked out that allow to get experience with the usefulness of the concept for the modelling of (data-processing) systems and systems from other application areas.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Typing of Graph Transformation Units

Klempien-Hinrichs

Kreowski

Kuske

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The concept of graph transformation units in its original sense is a structuring principle for graph transformation systems which allows the interleaving of rule applications with calls of imported units in a controlled way. The semantics of a graph transformation unit is a binary relation on an underlying type of graphs. In order to get a flexible typing mechanism for transformation units and a high degree of parallelism this paper introduces typed graph transformation units that transform k-tuples of typed input graphs into l-tuples of typed output graphs in a controlled and structured way. The transformation of the typed graph tuples is performed with actions that apply graph transformation rules and imported typed units simultaneously to the graphs of a tuple. The transformation process is controlled with control conditions and with graph tuple class expressions. The new concept of typed graph transformation units is illustrated with examples from the area of string parsing with finite automata.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Another form of typing in the area of graph transformation can be found in the notion of pair grammars and triple grammars where a pair resp. a triple of graphs is derived in parallel by applying rules in all components simultaneously (see, e.g., [14,16]). …”

Section: G(x)mentioning

confidence: 99%

Typing of Graph Transformation Units

Klempien-Hinrichs

Kreowski

Kuske

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Execution and definition of integration rules is based on graph transformation [EEKR99,SWZ99], in particular pair grammars [Pra71] and triple graph grammars [Sch95]. Early work at our department concerning integration in software engineering [LS96] was carried out on the basis of these techniques during the construction of the integrated software engineering environment IPSEN [Nag96].…”

Section: Consistency Managementmentioning

confidence: 99%

Model-based a-posteriori integration of engineering tools for incremental development processes

2005

View full text Add to dashboard Cite

A-posteriori integration of heterogeneous engineering tools supplied by different vendors constitutes a challenging task. In particular, this statement applies to incremental development processes where small changes have to be propagated -potentially bidirectionally -through a set of inter-dependent design documents which have to be kept consistent with each other. Responding to these challenges, we have developed an approach to tool integration which puts strong emphasis on software architecture and model-driven development. Starting from an abstract description of a software architecture, the architecture is gradually refined down to an implementation level. To integrate heterogeneous engineering tools, wrappers are constructed for abstracting from technical details and for providing homogenized data access. On top of these wrappers, incremental integration tools provide for inter-document consistency. These tools are based on graph models of the respective document classes and graph transformation rules for maintaining inter-document consistency. Altogether, the collection of support tools and the respective infrastructure considerably leverage the problem of composing a tightly integrated development environment from a set of heterogeneous engineering tools.

show abstract

“…Currently, such translation is defined in a precise but informal way. We intend to formalize it using, for example, pair grammars [21].…”

Section: T N ] Is the Parameter Type List P Of The Constructor;mentioning

confidence: 99%

Translating Java Code to Graph Transformation Systems

Corradini

Dotti

Foss

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems. Every program is translated to a set of rules including some basic rules, common to all programs and providing the operational semantics of Java (data and control) operators, and the program specific rules, namely one rule for each method or constructor declared in the program. Besides sketching some potential applications of the proposed translation, we discuss some desing choices that ensure its correctness, and we report on how do we intend to extend it in order to handle several other features of the Java language.

show abstract

Pair grammars, graph languages and string-to-graph translations

Cited by 118 publications

References 11 publications

Typing of Graph Transformation Units

Typing of Graph Transformation Units

Model-based a-posteriori integration of engineering tools for incremental development processes

Translating Java Code to Graph Transformation Systems

Contact Info

Product

Resources

About