[great-users] Transformation idioms

[Jeff Gray]

Hi Joe-

This is an interesting idea!

The only thing close that I have seen before (generically, not specifically
to GME/GREAT) is Jean Bezivin’s work at:

“TOWARDS MODEL TRANSFORMATION DESIGN PATTERNS”
http://www.sciences.univ-nantes.fr/lina/atl/www/papers/DesignPatterns05.pdf

I don’t think this is exactly what you had in mind, but the closest that I
have seen.

Jeff

----------------------------------------------------
Jeff Gray, Ph.D.
Department of Computer and Information Sciences
University of Alabama at Birmingham
gray at cis.uab.edu
http://www.gray-area.org
________________________________________
From: great-users-bounces at list.isis.vanderbilt.edu
[mailto:great-users-bounces at list.isis.vanderbilt.edu] On Behalf Of Joe
Porter
Sent: Tuesday, May 09, 2006 9:20 AM
To: great-users at list.isis.vanderbilt.edu
Subject: [great-users] Transformation idioms

I have a question:

Looking at the approach and capabilities of the GReAT toolchain, it seems
like you would want to have some common algorithmic idioms.  I'm thinking of
things like finding disjoint subgraphs or spanning trees.  One of the
examples also mentioned topological sort. I'm stretching a little here since
I haven't used the tool, but this is a journey of understanding.   Is there
a way to do that sort of thing generically for different metamodels, or are
things like that even useful in practice?  Or rather, have I missed
something regarding the approach? 

Hopefully all of you that use GReAT on a regular basis can steer me in the
right direction.

Thanks,
-Joe Porter
Southwest Research Institute