CAUTION: The Sender of this email is not from within Dalhousie. An exciting new talk in our series. See you on Friday. Reiko On 01/03/2021, 08:57, "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, March 12, 15:00 CET “Composition-based Graph Rewriting”, J.-P. Jouannaud (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%7C228abb3e4a77471424ff08d8dc900758%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C1%7C637501858448800423%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=k5Wqbt8Y%2BCgF%2FXk1o1x87RYmF%2F4V9epahvb3z1zRyz8%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%7C228abb3e4a77471424ff08d8dc900758%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C1%7C637501858448810419%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=TmC3vIbrR9IK07wNxz6THHncB4uLCqCxjbdv%2FdL3RBM%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, March 12, 15:00 CET Title: Composition-based Graph Rewriting Speaker: Jean-Pierre Jouannaud (Laboratoire d'Informatique (LIX), École Polytechnique, France) Abstract: Double Pushout (DPO) rewriting, the dominant model for graph rewriting, emerged in the early 70’s, strongly influenced at that time by graph grammars. Developed by Hartmut Ehrig and his many collaborators, graph rewriting was from the beginning based on category theory, with the major insight that the two basic rewriting constructions, namely matching and replacement, were intimately related to graph morphisms and their pushouts. A new model has emerged recently, so-called Composition based rewriting (Core), in which rewriting is based on a composition operator over directed rooted labelled graphs (drags), so that matching a drag G against a drag L amounts to compose L with some context drag C, and rewriting G with L -> R to compose R with C. We will describe Core for drags before to relate it precisely to DPO and extend it to adhesive categories of graphs and beyond. We will also show how to define composition abstractly in any category of graphs satisfying appropriate properties among which adhesivity (wrt monomorphisms). Major differences between DPO and Core will be discussed. Zoom registration link: https://zoom.us/meeting/register/tJEpdO2gqjgqHd282gCQlEKac0SfhYOxImqV<https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fzoom.us%2Fmeeting%2Fregister%2FtJEpdO2gqjgqHd282gCQlEKac0SfhYOxImqV&data=04%7C01%7Crh122%40leicester.ac.uk%7C228abb3e4a77471424ff08d8dc900758%7Caebecd6a31d44b0195ce8274afe853d9%7C0%7C1%7C637501858448810419%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000&sdata=xIsmLw9FgG5EPpCtgy007hmNAAKp%2BMf00QC5XwCfwqk%3D&reserved=0> Link to YouTube live stream: https://youtu.be/7Shd5RIcGd8 ___________________________________________________ ---------------------------------------------------------------------------- GReTA - Graph TRansformation Theory and Applications International Online Seminar Series --------------------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]