- 10:00 - 11:00
Speaker
: Barbara
König - Université Duisburg-Essen
Title : Well-Structured Graph Transformation Systems
Abstract : Graph transformation systems (GTSs)
can be seen as well-structured transition systems (WSTSs), thus
obtaining decidability results for certain classes of GTSs. It was
shown that well-structuredness can be obtained using the minor
ordering as a well-quasi-order. We extend this idea to obtain a
general framework in which several types of GTSs can be seen as
(restricted) WSTSs. We instantiate this framework with the subgraph
ordering and the induced subgraph ordering. Furthermore we present the
tool UNCOVER and discuss runtime results.
This is joint work
with Jan
Stückrath.
Slides: koenig-gtswsts.pdf
- 11:00 - 12 : 00
Speaker : Russ Harmer - LIP, ENS-Lyon
Title : Implicit state simulation
Abstract : We present the conceptual foundations
of the implicit state simulation algorithm used by the rule-based
modeling language Kappa. In particular, we show how various pieces
of structure in the category of site graphs are used to describe
the underlying graph rewriting mechanism that effects state
changes; and the evolution of the so-called 'event horizon' that
describes all the matchings that are possible in a given state.
- 12:00 - 13:30
Lunch
- 13:30 -14:30
Speaker : Pawel Sobocinski - University of Southampton
Title : Rigid Graphs for Adaptive Networks
Abstract : Rule refinement in rule-based
stochastic systems helps to produce systems amenable to analysis.
Rigidity is a property of graphs introduced in Kappa to support
refinement, allowing to preserve the number of matches for rules in
the refined system. In this talk: 1) we propose a notion of
rigidity in an axiomatic setting based on adhesive categories; 2)
show how it can lead to rule-refinement a-la-Kappa in a wide range
of models. We illustrate our approach on an example of a social
network with dynamic topology. Joint work with Reiko Heckel and
Vincent Danos.
- 14:30 - 15:30
Speaker : Frederic Prost - LIP, ENS-Lyon
Title : AGREE -- Algebraic Graph Rewriting with Controlled Embedding
Abstract : The several algebraic approaches to
graph transformation proposed in the literature all ensure that if
an item is preserved by a rule, so are its connections with the
context graph where it is embedded. But there are applications in
which it is desirable, for example when cloning an item, to specify
different embeddings for the original and for the copy. Therefore
we propose a conservative extension of these approaches where a
rule can specify how the embedding of a preserved item should be
changed, typically by removing certain connections. This is
joint work with Andrea Corradini, Dominique Duval, Rachid Echahed
and Leila Ribeiro.
Slides : AGREE.pdf