Contact: Andrea Corradini (andrea AT
Young researchers (who completed their doctoral studies within the past 2 years) and PhD students interested in the foundations and applications of graph transformation will have the opportunity of presenting their work in a few dedicated technical sessions of ICGT2008. This will give them a unique opportunity to interact with established researchers of the graph transformation community.
Presentations will be selected on the basis of submitted three-pages abstracts by the Program Committee of ICGT2008 according to their originality, significance, and general interest. Selected authors of presentations will be invited to submit a full paper for the refereed post-proceedings of the symposium.
Workshop on Graph Computation Models
Mohamed Mosbah (mosbah AT labri.fr)
variety of computation models have been developed using graphs
and graph transformations. These models include features for
programming languages and systems, paradigms for software
development, concurrent calculi, local computations and
distributed algorithms, biological or chemical computations.
Graph transformations can be an intermediate representation of a
computation. In addition to being visual and intuitive, this
representation also allows the use of mathematical methods for
analysis and manipulation. The aim of the workshop is to bring
together researchers interested in all aspects of computation
models based on graphs and graph transformation techniques, and
their applications. A particular emphasis will be made for
models and tools describing general solutions. The workshop will
include contributed papers, tutorials and tool demonstrations.
Graph Transformation Tool Contest
Arend Rensink (rensink AT cs.utwente.nl)
workshop is the fourth workshop in a series that serves as a
forum for researchers and practitioners interested in the
development and application of graph-based tools. In contrast to
earlier instances, however, this year the workshop is organised
in the form of a contest, continuing and (hopefully) improving
upon the tool contest held in conjunction with the AGTIVE 2007
workshop. We are planning a combination of submitted solutions
to a pre-defined set of problems, with a "live contest
session". That is, the workshop will feature a session
where contenders may use their tool of choice to model a problem
that is handed out at the beginning of the day. In addition
there will be presentation sessions in the afternoon, where both
the submitted solutions to the predefined problem(s) and the
live solutions will be presented.
Tutorial: Foundations and Applications of Graph
Heckel (reiko AT mcs.le.ac.uk)
tutorial is intended as a general introduction to graph
transformation for participants to the conference or its satellite
events who are not familiar with the mainstream approaches and concepts
of the area.
The tutorial will start with an informal introduction to the basic
concepts of graph transformation, such as graphs, rules,
transformations, discussing semantic choices such as the handling of
dangling edges during rewriting, and extensions such as attributes,
types, or inheritance.
In the second part, the tutorial will give a survey of typical
applications of graph transformation, for example as a specification
language and semantic model for concurrent and distributed systems, as a
model transformation language for defining syntax, semantics, and
manipulation of visual models, etc.
Finally, the tutorial will go into some details about the theory of (in
particular) the algebraic
approach to graph transformation, its formal foundations and relevant
theory and tools. This shall enable the participants to better
appreciate the conference and its satellite events.
aim of the workshop is to favour an exchange of ideas, notions,
techniques between the fields of Petri nets and graph
transformation systems, two prominent specification formalisms
of concurrency and distribution. It belongs to the folklore
that Petri nets can be seen as rewriting systems over
(multi)sets, the rewriting rules being the transitions, and, as
such they can be seen as special graph transformation systems.
This close correspondence between the two models has naturally
led to a mutual influence and a fruitful cross-fertilization.
Several approaches to the concurrent semantics of graph
transformation systems as well as techniques for their analysis
and verification are strongly influenced by the corresponding
theories and constructions for Petri nets. Classical Petri nets
models have been integrated with graph transformation systems,
e.g., in order to define rule-based changes in the Petri net
structure. This serves both for a stepwise refinement of Petri
net models or for the specification of dynamically reconfiguring
nets. Interesting connections exist with extensions of Petri net
models with dynamic topologies, or with notions of Petri net
module/component. Graph transformation systems are also used for
the development, the simulation, or animation of various types
of Petri nets, e.g., via the the definition of visual languages
and environments. Any contribution which can help in continuing
this productive interaction will be welcome.
Natural Computing and Graph Transformation
Contact: Ion Petre (ipetre AT abo.fi)
Computing is a research area concerned with computing taking
place in nature and with human-designed computing inspired by
nature. It is a fast growing, genuinely interdisciplinary field
involving, among others, biology, mathematics and computer
science. Graphs and graph transformations are of great interest
in this field in several respects. On the one hand, graphs are
often used in the modeling of natural processes either as a
representation of the hierarchical structures involved in the
process or as a way to formalize the features of reality on
several levels of abstraction. Several graph related
formalisms such as Petri nets, abstract state machines,
automata, membrane systems, mobile ambients, etc., are already
used as modeling tools for natural processes. On the other hand,
in human-designed computing inspired by nature, graph
theoretical formulations and problems are often used as
benchmarks for the investigation of the potential of the
proposed computational paradigms.