FW: Invitation: GReTA online seminar, January 29 at 15:00 CET

FW: Invitation: GReTA online seminar, January 29 at 15:00 CET

[Heckel, Reiko (Prof.)]

FYI, the next instalment of our seminar this Friday

Reiko

On 25/01/2021, 08:44, "GReTA seminar organisers" <greta@irif.fr> wrote:

Dear colleagues,

It is our great pleasure to invite you to a seminar of the “GReTA - Graph  Transformation Theory and Applications” series:

    Friday, January 29, 15:00 CET
    “Confluence of Graph Transformation”, L. Lambers and F. Orejas
    (abstract: see attached)

Please refer to http://www.irif.fr/~greta<https://eur03.safelinks.protection.outlook.com/?url=http:%2F%2Fwww.irif.fr%2F~greta&data=04%7C01%7Crh122%40leicester.ac.uk%7C1fbaa64f8e104bdb7a2508d8c10d5ddd%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C0%7C637471610450612755%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=qg8Eq3hyrnR9dhyCHW2%2B0lQY%2BQIBbAebvveYsyzi2bU%3D&reserved=0> 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<https://eur03.safelinks.protection.outlook.com/?url=https:%2F%2Fwww.irif.fr%2F~greta%2F%23talks&data=04%7C01%7Crh122%40leicester.ac.uk%7C1fbaa64f8e104bdb7a2508d8c10d5ddd%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C0%7C637471610450622745%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=mwdCrd2CTS4x7VqCus%2FS3CUAOA3rK9Ru3OqAZXpodpY%3D&reserved=0> for a list of upcoming events).

With best regards,

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


___________________________________________________

Date and time: Friday, January 29, 15:00 CET
Speaker: L. Lambers and F. Orejas
Title: Confluence of Graph Transformation

Abstract:

Confluence has been studied for graph transformation since several decades now.  Confluence analysis has been applied, for example, to determining uniqueness of model transformation results in model-driven engineering.  It is  strongly related to conflict analysis for graph transformation, i.e. detecting and inspecting all possible conflicts that may occur for a given set of graph transformation rules. The latter finds applications, for example, in software analysis and design.  Both conflict and confluence analysis rely  on the existence and further analysis of a finite and representative set of conflicts for a given set of graph transformation rules.

Traditionally, the set of critical pairs has been shown to constitute such a set. It is representative in the sense that for each conflict a critical pair exists, representing the conflict in a minimal context, such that it can be extended injectively to this conflict (M-completeness). Recently, it has been shown that initial conflicts constitute a considerably reduced subset of critical pairs, being still representative in a slightly different way.  In particular, for each conflict there exists a unique initial conflict that can be extended (possibly non-injectively) to the given conflict (completeness).  Compared to the set of critical pairs, the smaller set of initial conflicts allows for more efficient conflict as well as confluence analysis.

We continue by demonstrating that initial conflicts (critical pairs) are minimally complete (resp. minimally M-complete), and thus are both optimally reduced w.r.t. representing conflicts in a minimal context via general (resp. injective) extension morphisms. We proceed with showing that it is impossible to generalize this result to the case of rules with application conditions (equivalent to FOL on graphs).  We therefore revert to a symbolic setting, where finiteness and minimal (M-)completeness can again be guaranteed.  Finally, we describe important special cases (e.g. rules with negative application conditions), where we are able to obtain minimally complete (resp. M-complete) sets of conflicts in the concrete setting again.

Zoom registration link:

https://zoom.us/meeting/register/tJIrd-ihrzgqHdO7-bPkhQG92mDpzKdIBCHb<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fzoom.us%2Fmeeting%2Fregister%2FtJIrd-ihrzgqHdO7-bPkhQG92mDpzKdIBCHb&data=04%7C01%7Crh122%40leicester.ac.uk%7C1fbaa64f8e104bdb7a2508d8c10d5ddd%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C0%7C637471610450632739%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=6GSXp3JhWJ1%2B3gWMY%2FPQG5De3Nghru6sQeF8WkliQpY%3D&reserved=0>


Link to YouTube live stream:

https://youtu.be/Um90A_lk4ik<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fyoutu.be%2FUm90A_lk4ik&data=04%7C01%7Crh122%40leicester.ac.uk%7C1fbaa64f8e104bdb7a2508d8c10d5ddd%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C0%7C637471610450632739%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=1Tks2cNIwbnTn8lIlYf9Q%2FExAxckaLJomgOeUkYE5Po%3D&reserved=0>
___________________________________________________


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