Yesterday it was the PILE PETER Universe, let’s try a PILE ‚representation‘ of a TGraph today. TGraphs, i.e. typed, attributed, and ordered directed graphs, were introduced by (Ebert/Franzke 1995), see the reference at the end of this post.
Our PILE (learning environment) user/agent likes to deal with a TGraph now. The following figure shows A TGraph Representation of a State Chart:
We take our Terminal values (Tvs) from the legend of above figure:
- elem Blop
- and Blop
- xor Blop
- other relationship
In addition to that 8 Tvs, we will use Tvs for the letters A, B, C, D, E, F, G, H, I and a, b, c, d, as well as x, y. That sums up to 23 Tvs.
The next figure shows our PILE TGRAPH Universe. If you’d take another look at the TGraph above, we started with the upper left corner, i.e. the xor Blop ’named‘ A.
Let’s stop here (it’s Friday after all). Our PILE system can now deal with „A contains B“, can’t it?
As always, I’m curious to read your comments, which I’d prefer to share with the community in the Pile mailing list.
Ebert, Jürgen; Franzke, Angelika (1995): A Declarative Approach to Graph Based Modeling. In: Mayr, Ernst W.; Schmidt, G.; Tinhofer, G. (Hg.): Graph-theoretic concepts in computer science. 20th International Workshop, WG ’94, Herrsching, Germany, June 16 – 18, 1994 ; proceedings. Berlin. Springer (Lecture notes in computer science, p. 38–50.