Log in

Relevant bibliographies by topics / Triple Graph Grammar / Journal articles

To see the other types of publications on this topic, follow the link: Triple Graph Grammar.

Journal articles on the topic 'Triple Graph Grammar'

Author: Grafiati

Published: 4 June 2021

Last updated: 2 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 23 journal articles for your research on the topic 'Triple Graph Grammar.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Stouffs, Rudi, Helga Tauscher, and Filip Biljecki. "Achieving Complete and Near-Lossless Conversion from IFC to CityGML." ISPRS International Journal of Geo-Information 7, no. 9 (August 27, 2018): 355. http://dx.doi.org/10.3390/ijgi7090355.

Full text

Abstract:

The Singapore Government has embarked on a project to establish a three-dimensional city model and collaborative data platform for Singapore. The research herein contributes to this endeavour by developing a methodology and algorithms to automate the conversion of Building Information Models (BIM), in the Industry Foundation Classes (IFC) data format, into CityGML building models, capturing both geometric and semantic information as available in the BIM models, and including exterior as well as interior structures. We adopt a Triple Graph Grammar (TGG) to formally relate IFC and CityGML, both semantically and geometrically, and to transform a building information model, expressed as an IFC object graph, into a city model expressed as a CityGML object graph. The work pipeline includes extending the CityGML data model with an Application Domain Extension (ADE), which allows capturing information from IFC that is relevant in the geospatial context but at the same time not supported by CityGML in its standard form. In this paper, we elaborate on the triple graph grammar approach and the motivation and roadmap for the development of the ADE. While a fully complete and lossless conversion may never be achieved, this paper suggests that both a TGG and an ADE are natural choices for supporting the conversion between IFC and CityGML.

APA, Harvard, Vancouver, ISO, and other styles

2

Tauscher, H. "CREATING AND MAINTAINING IFC–CITYGML CONVERSION RULES." ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences IV-4/W8 (September 23, 2019): 115–22. http://dx.doi.org/10.5194/isprs-annals-iv-4-w8-115-2019.

Full text

Abstract:

<p><strong>Abstract.</strong> We employ a triple graph grammar to enable configurable conversion from IFC to CityGML. In this paper, we present the mathematical framework behind the graph transformation approach as well as an application to create, store and maintain transformation rules implementing this framework. Particular emphasis is put on how the approach enables graphical representation and static analysis of rules and rulesets, both in the theoretical framework and prototypical implementation. Even if various publications and tools for general graph transformation do already exist, we hope that the BIM–GIS community will benefit from a domain-specific introduction to the theory and dedicated software tools.</p>

APA, Harvard, Vancouver, ISO, and other styles

3

Chama, Wafa, Allaoua Chaoui, and Seidali Rehab. "Formal Modeling and Analysis of Object Oriented Systems using Triple Graph Grammars." International Journal of Embedded and Real-Time Communication Systems 6, no. 2 (April 2015): 48–64. http://dx.doi.org/10.4018/ijertcs.2015040103.

Full text

Abstract:

This paper proposes a Model Driven Engineering automatic translation approach based on the integration of rewriting logic formal specification and UML semi-formal models. This integration is a contribution in formalizing UML models since it lacks for formal semantics. It aims at providing UML with the capabilities of rewriting logic and its Maude language to control and detect incoherencies in their diagrams. Rewriting logic Maude language allows simulation and verification of system's properties using its LTL model-checker. This automatic translation approach is based on meta-modeling and graph transformation since UML diagrams are graphs. More precisely, the authors have proposed five meta-models and three triple graph grammars to perform the translation process. The authors have used Eclipse Generative Modeling tools: Eclipse Modeling Framework (EMF) for meta-modeling, Graphical Modeling Framework (GMF) for generating visual modeling tools and TGG Interpreter for proposing triple graph grammars. The approach is illustrated through an example.

APA, Harvard, Vancouver, ISO, and other styles

4

Königs, Alexander, and Andy Schürr. "Tool Integration with Triple Graph Grammars - A Survey." Electronic Notes in Theoretical Computer Science 148, no. 1 (February 2006): 113–50. http://dx.doi.org/10.1016/j.entcs.2005.12.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lukacs, D., and M. Toth. "Translating Erlang State Machines to UML Using Triple Graph Grammars." Studia Universitatis Babeș-Bolyai Informatica 63, no. 1 (June 19, 2018): 33–50. http://dx.doi.org/10.24193/subbi.2018.1.03.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bencharqui, Hatime, Younes Moubachir, and Adil Anwar. "On the use of Triple Graph Grammars for Model Composition." Advances in Science, Technology and Engineering Systems Journal 5, no. 2 (2020): 653–64. http://dx.doi.org/10.25046/aj050281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lohmann, Carsten, Joel Greenyer, Juanjuan Jiang, and Tarja Systä. "Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations." Journal of Object Technology 6, no. 9 (2007): 253. http://dx.doi.org/10.5381/jot.2007.6.9.a13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Buchmann, Thomas, and Bernhard Westfechtel. "Using triple graph grammars to realise incremental round‐trip engineering." IET Software 10, no. 6 (December 2016): 173–81. http://dx.doi.org/10.1049/iet-sen.2015.0125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hermann, Frank, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, and Thomas Engel. "Model synchronization based on triple graph grammars: correctness, completeness and invertibility." Software & Systems Modeling 14, no. 1 (January 22, 2013): 241–69. http://dx.doi.org/10.1007/s10270-012-0309-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Jakob, Johannes, and Andy Schürr. "View Creation of Meta Models by Using Modified Triple Graph Grammars." Electronic Notes in Theoretical Computer Science 211 (April 2008): 181–90. http://dx.doi.org/10.1016/j.entcs.2008.04.040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Giese, Holger, Stephan Hildebrandt, and Leen Lambers. "Bridging the gap between formal semantics and implementation of triple graph grammars." Software & Systems Modeling 13, no. 1 (April 28, 2012): 273–99. http://dx.doi.org/10.1007/s10270-012-0247-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Anjorin, Anthony, and Marius Lauder. "A Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon." Electronic Proceedings in Theoretical Computer Science 135 (November 29, 2013): 69–74. http://dx.doi.org/10.4204/eptcs.135.8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Ehrig, Hartmut, Frank Hermann, Hanna Schölzel, and Christoph Brandt. "Propagation of constraints along model transformations using triple graph grammars and borrowed context." Journal of Visual Languages & Computing 24, no. 5 (October 2013): 365–88. http://dx.doi.org/10.1016/j.jvlc.2013.08.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Leblebici, Erhan, Anthony Anjorin, Andy Schürr, and Gabriele Taentzer. "Multi-amalgamated triple graph grammars: Formal foundation and application to visual language translation." Journal of Visual Languages & Computing 42 (October 2017): 99–121. http://dx.doi.org/10.1016/j.jvlc.2016.03.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Greenyer, Joel, and Ekkart Kindler. "Comparing relational model transformation technologies: implementing Query/View/Transformation with Triple Graph Grammars." Software & Systems Modeling 9, no. 1 (July 15, 2009): 21–46. http://dx.doi.org/10.1007/s10270-009-0121-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Tauscher, H. "TOWARDS A GENERIC MAPPING FOR IFC-CITYGML DATA INTEGRATION." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIV-4/W1-2020 (September 3, 2020): 151–58. http://dx.doi.org/10.5194/isprs-archives-xliv-4-w1-2020-151-2020.

Full text

Abstract:

Abstract. Much work has been carried out on the topic of BIM-GIS integration. As a technical challenge in particular, research and development tackle the standard data formats of the two areas and aim for the conversion between, linking of or overarching querying over data sources of these formats. Usually, these operational cases (conversion, linking, querying) are examined in isolation or even treated as mutually exclusive and competing approaches. With Triple Graph Grammars, we propose to apply a method that allows to derive solutions for these operational cases from a common generic ruleset. We demonstrate this approach in a proof-of-concept implementation using eMoflon. Our work focusses on IFC and CityGML and we present and discuss a first end-to-end demonstration of integrating these standards with the proposed method. Going forward such representation of the correlation between IFC and CityGML, declarative, independent of particular operational implementations, can serve as a vehicle to capture and document acknowledged integration schemes for IFC and CityGML, complementing these two standards with a specification of their correlation.

APA, Harvard, Vancouver, ISO, and other styles

17

Johnson, Thomas, Aleksandr Kerzhner, Christiaan J. J. Paredis, and Roger Burkhart. "Integrating Models and Simulations of Continuous Dynamics Into SysML." Journal of Computing and Information Science in Engineering 12, no. 1 (December 21, 2011). http://dx.doi.org/10.1115/1.4005452.

Full text

Abstract:

In this paper, we combine modeling constructs from systems modeling language (SysML) and Modelica to improve the support for model-based systems engineering (MBSE). The Object Management Group has recently developed the systems modeling language (OMG SysML™). This visual modeling language provides a comprehensive set of diagrams and constructs for modeling many common aspects of systems engineering problems, such as system requirements, structures, functions, and behaviors. Complementing these SysML constructs, the modelica language has emerged as a standard for modeling the continuous dynamics of systems in terms of hybrid discrete-event and differential algebraic equation systems. In this paper, the synergy between SysML and Modelica is explored at three different levels: the definition of continuous dynamics models in SysML, the use of triple graph grammar based transformations to map between these SysML constructs and the corresponding Modelica models, and the integration of simulation experiments with other SysML constructs to support MBSE. Throughout the paper, an example of a car suspension is used to demonstrate these contributions.

APA, Harvard, Vancouver, ISO, and other styles

18

Anjorin, Anthony. "Declarative Model Transformations with Triple Graph Grammars." Electronic Proceedings in Theoretical Computer Science 234 (January 1, 2017). http://dx.doi.org/10.4204/eptcs.234.0.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

HERMANN, FRANK, HARTMUT EHRIG, ULRIKE GOLAS, and FERNANDO OREJAS. "Formal analysis of model transformations based on triple graph grammars." Mathematical Structures in Computer Science 24, no. 4 (June 26, 2014). http://dx.doi.org/10.1017/s0960129512000370.

Full text

Abstract:

Triple graph grammars (TGGs) are a well-established concept for the specification and execution of bidirectional model transformations within model driven software engineering. Their main advantage is an automatic generation of operational rules for forward and backward model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we present several important results for analysing model transformations based on the formal categorical foundation of TGGs within the framework of attributed graph transformation systems.Our first main result shows that the crucial properties of correctness and completeness are ensured for model transformations. In order to analyse functional behaviour, we generate a new kind of operational rule, called aforward translation rule. We apply existing results for the analysis of local confluence for attributed graph transformation systems. As additional main results, we provide sufficient criteria for the verification of functional behaviour as well as a necessary and sufficient condition for strong functional behaviour. In fact, these conditions imply polynomial complexity for the execution of the model transformation. We also analyse information and complete information preservation of model transformations, that is, whether a source model can be reconstructed (uniquely) from the target model computed by the model transformation. We illustrate the results for the well-known model transformation example from class diagrams to relational database models.

APA, Harvard, Vancouver, ISO, and other styles

20

Weidmann, Nils, and Anthony Anjorin. "Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming." Formal Aspects of Computing, August 24, 2021. http://dx.doi.org/10.1007/s00165-021-00557-0.

Full text

Abstract:

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

APA, Harvard, Vancouver, ISO, and other styles

21

Dang, Duc-Hanh, and Martin Gogolla. "An OCL-Based Framework for Model Transformations." VNU Journal of Science: Computer Science and Communication Engineering 32, no. 1 (March 11, 2016). http://dx.doi.org/10.25073/2588-1086/jcsce.120.

Full text

Abstract:

Model transformation is an important building block for model-driven approaches. It puts forward a necessity and a challenge to specify and realize model transformation as well as to ensure the correctness of transformations. This paper proposes an OCL-based framework for model transformations. The formal foundation of the framework is the integration of Triple Graph Grammars and the Object Constraint Language (OCL). The OCL-based transformation framework offers an on-the-fly verification of model transformations and means for transformation quality assurance.

APA, Harvard, Vancouver, ISO, and other styles

22

Fritsche, Lars, Jens Kosiol, Andy Schürr, and Gabriele Taentzer. "Avoiding unnecessary information loss: correct and efficient model synchronization based on triple graph grammars." International Journal on Software Tools for Technology Transfer, September 8, 2020. http://dx.doi.org/10.1007/s10009-020-00588-7.

Full text

Abstract:

Abstract Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple graph grammars (TGGs) specify model consistency by means of rules that describe how to create consistent pairs of models. These rules can be used to automatically derive further rules, which describe how to propagate changes from one model to the other or how to change one model in such a way that propagation is guaranteed to be possible. Restricting model synchronization to these derived rules, however, may lead to unnecessary deletion and recreation of model elements during change propagation. This is inefficient and may cause unnecessary information loss, i.e., when deleted elements contain information that is not represented in the second model, this information cannot be recovered easily. Short-cut rules have recently been developed to avoid unnecessary information loss by reusing existing model elements. In this paper, we show how to automatically derive (short-cut) repair rules from short-cut rules to propagate changes such that information loss is avoided and model synchronization is accelerated. The key ingredients of our rule-based model synchronization process are these repair rules and an incremental pattern matcher informing about suitable applications of them. We prove the termination and the correctness of this synchronization process and discuss its completeness. As a proof of concept, we have implemented this synchronization process in eMoflon, a state-of-the-art model transformation tool with inherent support of bidirectionality. Our evaluation shows that repair processes based on (short-cut) repair rules have considerably decreased information loss and improved performance compared to former model synchronization processes based on TGGs.

APA, Harvard, Vancouver, ISO, and other styles

23

Stünkel, Patrick, Harald König, Yngve Lamo, and Adrian Rutle. "Comprehensive Systems: A formal foundation for Multi-Model Consistency Management." Formal Aspects of Computing, July 30, 2021. http://dx.doi.org/10.1007/s00165-021-00555-2.

Full text

Abstract:

AbstractModel management is a central activity in Software Engineering. The most challenging aspect of model management is to keep inter-related models consistent with each other while they evolve. As a consequence, there is a lot of scientific activity in this area, which has produced an extensive body of knowledge, methods, results and tools. The majority of these approaches, however, are limited to binary inter-model relations; i.e. the synchronisation of exactly two models. Yet, not every multi-ary relation can be factored into a family of binary relations. In this paper, we propose and investigate a novel comprehensive system construction, which is able to represent multi-ary relations among multiple models in an integrated manner and thus serves as a formal foundation for artefacts used in consistency management activities involving multiple models. The construction is based on the definition of partial commonalities among a set of models using the same language, which is used to denote the (local) models. The main theoretical results of this paper are proofs of the facts that comprehensive systems are an admissible environment for (i) applying formal means of consistency verification (diagrammatic predicate framework), (ii) performing algebraic graph transformation (weak adhesive HLR category), and (iii) that they generalise the underlying setting of graph diagrams and triple graph grammars.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!