From mboxrd@z Thu Jan 1 00:00:00 1970 X-Msuck: nntp://news.gmane.io/gmane.science.mathematics.categories/10377 Path: news.gmane.io!.POSTED.blaine.gmane.org!not-for-mail From: "Heckel, Reiko (Prof.)" Newsgroups: gmane.science.mathematics.categories Subject: FW: Invitation: GReTA online seminar, January 29 at 15:00 CET Date: Thu, 28 Jan 2021 09:02:01 +0000 Message-ID: Reply-To: "Heckel, Reiko (Prof.)" Content-Type: text/plain; charset="Windows-1252" Content-Transfer-Encoding: quoted-printable Injection-Info: ciao.gmane.io; posting-host="blaine.gmane.org:116.202.254.214"; logging-data="10597"; mail-complaints-to="usenet@ciao.gmane.io" To: "categories@mta.ca" Original-X-From: majordomo@rr.mta.ca Fri Jan 29 22:08:55 2021 Return-path: Envelope-to: gsmc-categories@m.gmane-mx.org Original-Received: from smtp2.mta.ca ([198.164.44.75]) by ciao.gmane.io with esmtps (TLS1.2:ECDHE_RSA_AES_256_GCM_SHA384:256) (Exim 4.92) (envelope-from ) id 1l5b0g-0002dj-PQ for gsmc-categories@m.gmane-mx.org; Fri, 29 Jan 2021 22:08:54 +0100 Original-Received: from rr.mta.ca ([198.164.44.159]:41696) by smtp2.mta.ca with esmtp (Exim 4.80) (envelope-from ) id 1l5ayY-0005sK-I9; Fri, 29 Jan 2021 17:06:42 -0400 Original-Received: from majordomo by rr.mta.ca with local (Exim 4.92.1) (envelope-from ) id 1l5avJ-0003tb-IO for categories-list@rr.mta.ca; Fri, 29 Jan 2021 17:03:21 -0400 Accept-Language: en-GB, en-US Content-Language: en-GB Precedence: bulk Xref: news.gmane.io gmane.science.mathematics.categories:10377 Archived-At: FYI, the next instalment of our seminar this Friday Reiko On 25/01/2021, 08:44, "GReTA seminar organisers" wrote: Dear colleagues, It is our great pleasure to invite you to a seminar of the =93GReTA - Graph= Transformation Theory and Applications=94 series: Friday, January 29, 15:00 CET =93Confluence of Graph Transformation=94, L. Lambers and F. Orejas (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.ir= if.fr/~greta/#talks 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 uni= queness of model transformation results in model-driven engineering. It is= strongly related to conflict analysis for graph transformation, i.e. detec= ting and inspecting all possible conflicts that may occur for a given set o= f graph transformation rules. The latter finds applications, for example, i= n software analysis and design. Both conflict and confluence analysis rely= on the existence and further analysis of a finite and representative set o= f 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 c= an be extended injectively to this conflict (M-completeness). Recently, it = has been shown that initial conflicts constitute a considerably reduced sub= set of critical pairs, being still representative in a slightly different w= ay. In particular, for each conflict there exists a unique initial conflic= t that can be extended (possibly non-injectively) to the given conflict (co= mpleteness). Compared to the set of critical pairs, the smaller set of ini= tial conflicts allows for more efficient conflict as well as confluence ana= lysis. We continue by demonstrating that initial conflicts (critical pairs) are mi= nimally complete (resp. minimally M-complete), and thus are both optimally = reduced w.r.t. representing conflicts in a minimal context via general (res= p. injective) extension morphisms. We proceed with showing that it is impos= sible to generalize this result to the case of rules with application condi= tions (equivalent to FOL on graphs). We therefore revert to a symbolic set= ting, where finiteness and minimal (M-)completeness can again be guaranteed= . Finally, we describe important special cases (e.g. rules with negative a= pplication conditions), where we are able to obtain minimally complete (res= p. M-complete) sets of conflicts in the concrete setting again. Zoom registration link: https://zoom.us/meeting/register/tJIrd-ihrzgqHdO7-bPkhQG92mDpzKdIBCHb Link to YouTube live stream: https://youtu.be/Um90A_lk4ik ___________________________________________________ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]