| F. Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262(12):377414, 2001. |
....a domain speci c layout for the animation view of a Petri net model. The well known speci cation of The Dining Philosophers serves as running example, where the system view is given as a Petri net, and the animation view visualizes directly the behavior of philosophers sitting at a table. In [Dre99] a tree based method for the generation of languages of fractals is introduced. This combines the nondeterministic nature of grammars as known from formal language theory with the in nite re nement of pictures studied in fractal geometry. A short introduction to the system Treebag, which allows ....
Frank Drewes. Tree-based generation of languages of fractals. Report 2/99, Univ. Bremen, 1999.
No context found.
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262:377-414, 2001.
No context found.
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262:377-414, 2001.
No context found.
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262:377-414, 2001.
....tables do not seem to be powerful enough. 2 This is because tables can only provide a global control while, here, the structure of the dependencies is more complicated. A possible solution is provided by a technique which was introduced in [Dre00b] see also the picture generator G Mosaic in [Dre00a, Section 6]) It provides a regulation principle 2 The authors strongly conjecture that this is true in a formal sense, but an exact proof seems to be tremendously dicult and would probably require proof techniques far beyond the known ones (cf. DKL97, DKK] 16 which is perhaps best described as ....
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science. To appear.
....tables do not seem to be powerful enough. 2 This is because tables can only provide a global control while, here, the structure of the dependencies is more complicated. A possible solution is provided by a technique which was introduced in [Dre00b] see also the picture generator G Mosaic in [Dre00a, Section 6]) It provides a regulation principle 2 The authors strongly conjecture that this is true in a formal sense, but an exact proof seems to be tremendously difficult and would probably require proof techniques far beyond the known ones (cf. DKL97,DKK] 16 which is perhaps best described as ....
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science. To appear.
No context found.
F. Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262(12):377414, 2001.
No context found.
Frank Drewes. Tree-based generation of languages of fractals. Theoretical Computer Science, 262:377-414, 2001.
No context found.
Frank Drewes. Tree-based generation of languages of fractals. Report 2/99, Univ. Bremen, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC