APPLIGRAPH Workshop on Applied Graph Transformation - AGT2002

Grenoble, France, April 12 - 13, 2002

ETAPS2002 Satellite Event








  NEW: The proceedings are now available for downloading here.


Graphs of all kinds are widely used to model complex states, structured objects, networks, and relational structures in many areas of computer science. Applied graph transformation is a rule-based framework for the specification and development of systems, languages, and tools that are founded on graphs. The area of graph transformation is supported by the ESPRIT Working Group APPLIGRAPH (Applications of Graph Transformation).

The final workshop of APPLIGRAPH is intended to bring together leading researchers in theory and application of graph transformation and researchers in other areas of ETAPS who are interested in graph transformation. For this reason, the workshop is not restricted to members of APPLIGRAPH, but open for anybody.

The contributions during the workshop will be based on extended abstracts selected by an international program committee. They will be published after revision as Informal Proceedings. The additional publication of a special issues of selected contributions in a journal after the workshop will be considered.

Further Information on APPLIGRAPH:


Main topics

Major topics of interest include but are not limited to the following:

Language issues. Features in graph transformation based languages, like typing, modularity, refinement, parallelism, concurrency, distribution, optimisation, and correctness.

Tool issues. Conception and design of support tools for graph transformation based languages including editors, parsers, interpreters, compilers, optimisers, verifiers, and graphical user interfaces.

Application domains. Demonstration of the usefulness of graph transformation by case studies in various areas like definition of visual languages, database models, concurrent and distributed systems, software process modeling, implementation of programming languages.



Friday, April 12, 2002

14.15 - 16.15 Opening and first session on OCL, UML, and AToM
P. Bottoni, M. Koch, F, Parisi-Presicce, and G. Taentzer Employing graph transformation for OCL
R. Heckel, J. Küster, and G. Taentzer Towards Automatic Translation of UML Models into Semantic Domains
E. Posse, J. de Lara, and H. Vangheluwe Processing Causal Block Diagrams with Graph-Grammars in AToM
16.15 - 16.45 coffee break
16.45 - 18.15 second session on distribution and a tool demonstration
B. Braatz, H. Ehrig, K. Hoffmann, J. Padberg, and M. Urbasek Application of Graph Transformation Techniques to the Area of Petri Nets: An Overview
Y. Metivier, M. Mosbah, and A. Sellami Proving Distributed Algorithms by Graph Relabelling Systems: Examples of Trees in Networks with Processor Identities
M. Faust Graph computing environment

Saturday, April 13, 2002

9.00 - 10.30 third session on various media
R. Bardohl, K. Ehrig, C. Ermel, A. Qemali, and I. Weinhold Specifying Visual Languages with GenGED
F. H. Gatzemeier, and O. Meyer Graph technology applied to editing structured natural-language documents
H. Jacquet, H. Rising III, and A. Tabatabai Graph rewriting techniques and tools for MPEG-7 multimedia description schemes
10.30 - 11.00 coffee break
11.00 - 12.30 fourth session on structuring and time
F. Drewes, B. Hoffmann, and M. Minas Constructing Shapely Nested Graph Transformations
R. Klempien-Hinrichs, P. Knirsch, and S. Kuske Modeling the Pickup-and-Delivery Problem with Structured Graph Transformation
S. Gyapay, and R. Heckel Towards graph transformaton with time
12.30 - 14.00 lunch
14.00 - 15.30 fifth session on applications
G. Busatto Modeling hyperweb dynamics through hierarchical graph transformation
M. Große-Rohde, S. John, and G. Schröter Transformation Systems for the Integration of Software Specifications
D. Varro Automated program generation for and by model transformation systems
15.30 - 16.00 coffee break
16.00 - 17.00 sixth session on theory
Nicolas Bonichon, Bertrand Le Saec, and Mohamed Mosbah Diagonal Flip Operations on Realizers and Their Application to Wagner's Theorem
A. Habel, and D. Plump A Core Language for Graph Transformation
17.00 - 18.00 closing session
20.00 workshops dinner


Important Dates

February 20, 2002 - Final Version of Extended Abstracts
April 12 - 13, 2002 - Workshop

The workshop will start on Friday the 12th at 14:15 and ends on Saturday at 18:00.


Program Committee

H. Ehrig TU Berlin, D
G. Engels University of Paderborn, D
D. Janssens University of Antwerp, B
H.-J. Kreowski University of Bremen, D (chair)
U. Montanari University of Pisa, I
M. Nagl RWTH Aachen,D
F. Parisi-Presicce University of Rome, I
R. Plasmeijer University of Nijmegen, NL
D. Plump University of York, UK
G. Rozenberg University of Leiden, NL



Prof. Dr. Hans-Jörg Kreowski
University of Bremen
Computer Science
PO Box 330440
D-28334 Bremen

Tel: +49 421-218 2956 or 3697 (Secr.)
Fax: +49 421-218 4322



Download the proceedings of the AGT2002 workshop

If you have problems downloading the files please send a message to