A Component Concept for Typed Graphs with Inheritance and Containment Structures: Long Version
نویسنده
چکیده
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which deserve a modularization concept to enable their structured development in larger teams. Graphs are a natural way to represent the underlying structure of visual models. Typed graphs with inheritance and containment are well suited to describe the essentials of models based on the Eclipse Modeling Framework (EMF). EMF models already support the physical distribution of model parts. Based on the concept of distributed graphs, we propose typed composite graphs with inheritance and containment to specify logical distribution structures of EMF models. The category-theoretical foundation of this kind of composite graphs forms a solid basis for the precise definition of typed composite graph transformations obeying inheritance and containment conditions.
منابع مشابه
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which deserve a modularization concept to enable their structured development in larger teams. Graphs are a natural way to represent the underlying structure of visual models. Typed graphs with inheritance and containment a...
متن کاملComposite modeling based on distributed graph transformation and the eclipse modeling framework
Model-driven development (MDD) has become a promising trend in software engineering for a number of reasons. Models as the key artifacts help the developers to abstract from irrelevant details, focus on important aspects of the underlying domain, and thus master complexity. As software systems grow, models may grow as well and nally become possibly too large to be developed and maintained in a ...
متن کاملFundamental Theory for Typed Attributed Graph Transformation: Long Version
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresp...
متن کاملAttributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs
Inheritance is an important and widely spread concept enabling the elegant expression of hierarchy in object-oriented software programs or models. It has been defined for graphs and graph transformations enhancing the applicability of this formal technique. Up to now, for the analysis of transformationswith inheritance a flattening constructionhas beenused, which yields all the well-known resul...
متن کاملConfluence of Adhesive HLR Systems with Applications to Typed Attributed Graph Transformation Systems
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages. In this thesis we introduce adhesive high-level replacement categories and systems as a new categorical framework for graph transformation in a broad sense. It combines the well-known concept of high-level replacement (HLR) systems with the new co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010