Graph Transformation Theory and Applications
Vendredi 18 décembre 2020, 15 heures, (online)
Maribel Fernandez & Bruno Pinaud (King's College London, UK & Université de Bordeaux, France) Hierarchical port graphs & PORGY - port graph rewriting as a modelling tool
This is joint work with members of the PORGY team at Bordeaux and King’s College London.
Graph Transformation Theory and Applications
Vendredi 4 décembre 2020, 15 heures, (online)
Daniel Merkle & Jakob Lykke Andersen (Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark) Chemical Graph Transformation and Applications
In this talk, we present our on-going work on creating a practical modelling framework for chemistry based on Double Pushout graph transformation, and how it can be applied to analyse chemical systems. We will address important technical design decisions as well as the importance of methods inspired from Algorithm Engineering in order to reach the required efficiency of our implementation. We will present chemically relevant features that our framework provides (e.g. automatic atom tracing) as well as a set of chemical systems we investigated are currently investigating. If time allows we will discuss variations of graph transformation rule compositions and their chemical validity.
Graph Transformation Theory and Applications
Vendredi 20 novembre 2020, 15 heures, (online)
Barbara König (Fakultät für Ingenieurwissenschaften, Universität Duisburg-Essen, Germany) Graph Transformation Meets Logic
In the graph transformation community the formalism of nested graph conditions has emerged, that is, conditions which are equivalent to first-order logic, but directly integrate graphs and graph morphisms, in order to express constraints more succinctly.
In this talk we also explain how the notion of nested conditions can be lifted from graph transformation systems to the setting of reactive systems as defined by Leifer and Milner. It turns out that some constructions for graph transformation systems (such as computing weakest preconditions and strongest postconditions and showing local confluence by means of critical pair analysis) can be done quite elegantly in the more general setting.