GReTA - Graph Transformation Theory and Applications” seminar series

GReTA - Graph Transformation Theory and Applications” seminar series

[Heckel, Reiko (Prof.)]

Dear colleagues,

It is our great pleasure to invite you to the very first seminar of the new  “GReTA - Graph Transformation Theory and Applications” series
--
Professor Reiko Heckel
School of Informatics,
University of Leicester, LE1 7RH

TEL: +44 (0)116 252 3406
Email: rh122@le.ac.uk



:

Friday, November 20, 15:00 CET
“Graph Transformation Meets Logic”, Barbara König
(abstract: see attached)

Please refer to http://www.irif.fr/~greta for further information on how to  register for this Zoom meeting, or alternatively on how to attend the meeting via a YouTube live stream!

The GReTA seminar series aims to serve as a platform for the international graph rewriting community, to promote recent developments and trends in the  field, and to permit a regular networking and interaction between members of this community. Seminars are scheduled twice a month (cf. https://www.irif.fr/~greta/#talks for a list of upcoming events).

With best regards,

Nicolas Behr, Reiko Heckel and Jean Krivine
(GReTA organisers)
___________________________________________________

Date and time: Friday, November 20, 15:00 CET
Speaker: Barbara König
Title: Graph Transformation Meets Logic

Abstract:

We review the integration of (first-order) logic respectively nested conditions into graph transformation. Conditions can serve various purposes: they  can constrain graph rewriting, symbolically specify sets of graphs, be used in query languages and in verification (for instance in Hoare logic and for behavioral equivalence checking).

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.

--
Professor Reiko Heckel
School of Informatics,
University of Leicester, LE1 7RH

TEL: +44 (0)116 252 3406
Email: rh122@le.ac.uk


[For admin and other information see: http://www.mta.ca/~cat-dist/ ]