Seminar: Businessplan in der Praxis: Bankengespräch
Wissenschaftliche(r) Mitarbeiter(in) im Bereich CSCW/Enterprise 2.0 gesucht
TGraphs
Description
TGraphs were developed by work group and are the main focus of our research. They are typed, attributed, and ordered directed graphs. TGraphs are very general kind of graph. There is a versatile data structure (Ebert1995ADA) which is able to represent all TGraph properties explained below:
- All vertices and edges of TGraphs are attributed, i.e. they may carry attribute-value pairs which assign concrete values to some attribute identifiers.
- Usually the vertices of a TGraph are typed, i.e. the set of attributes is determined by the types associated to the vertices and edges.
- The set of vertices and the set of edges of a TGraph are ordered and so is the set of incidences of edges to a given vertex.
- Nodes and edges are independent, identifiable first-class objects.
- Multiple edges, i.e. more than one edge may connect two nodes, are possible.
- The type system allows multiple inheritance on vertex as well as on edge types.
- Nodes and edges can have distinguishable class types.
This TGraph representation can be used to represent many kinds of graphs which are equal or poorer in their modeling power simply by ignoring some of the TGraph properties. The power of TGraphs is between Essential Meta Object Facility and Complete Meta Object Facility. But TGraphs still have got some attributes CMOF has not (e.g. edge attributes).
TGraphs including all their properties can be created and processed using the GraLab class library, modeled with GrUML or EER/GRAL, queried using GReQL and exchanged with GXL.
Example
The example below contains a TGraph Example:
Fields of Application
TGraphs are currently used in our projects GUPRO and ReDSeeDS.
Project Members
-
B 108
-
+49 261 287 -2722
-
ebert at uni-koblenz.de
-
B 015
-
+49 261 287 -2747
-
dbildh at uni-koblenz.de
-
B 119
-
+49 261 287 -2705
-
falke at uni-koblenz.de
-
B 121
-
+49 261 287-2706
-
riediger at uni-koblenz.de
-
B 118
-
+49 261 287-2764
-
winter at uni-koblenz.de
-
B 015
-
+49 261 287 -2749
-
hschwarz at uni-koblenz.de
Publications
2008
- [Ebert2008GTI2]
Jürgen Ebert, Volker Riediger, Andreas Winter: Graph Technology in Reverse Engineering, The TGraph Approach. in Rainer Gimnich, Uwe Kaiser, Jochen Quante, Andreas Winter: 10th Workshop Software Reengineering (WSR 2008). 2008. GI. Bonn. 126. GI Lecture Notes in Informatics. pp 67-81. - [Ebert2008MTS]
Jürgen Ebert: Metamodels Taken Seriously: The TGraph Approach. in Kostas Kontogiannis, Christos Tjortjis, Andreas Winter: 12th European Conference on Software Maintenance and Reengineering. 2008. IEEE Computer Society. Piscataway, NJ. - [Ebert2008UTT]
Jürgen Ebert, Volker Riediger, Hannes Schwarz, Daniel Bildhauer: Using the TGraph Approach for Model Fact Repositories. 2008. pp 9-18. Proceedings of the International Workshop on Model Reuse Strategies (MoRSe 2008).
1995
- [Ebert1995ADA]
Jürgen Ebert, Angelika Franzke: A Declarative Approach to Graph Based Modeling. in E. Mayr, G. Schmidt, G. Tinhofer: Graphtheoretic Concepts in Computer Science. 1995. Springer Verlag. Berlin. LNCS. 903. pp 38-50.
1987
- [Ebert1987AVD]
Jürgen Ebert: A Versatile Data Structure For Edge-Oriented Graph Algorithms. 1987. 30. 6. Communications ACM. 6. pp 513-519.
Kontakt