~~NOCACHE~~
/* DO NOT EDIT THIS FILE               */
/* THIS FILE WAS GENERATED             */
/* EDIT THE FILE "indexheader" INSTEAD */
/* OR ACCESS THE DATABASE              */

{{page>.:indexheader}}

\\ ==== Next talks ====
[[en:seminaires:greta:index|Graph Transformation Theory and Applications]]\\
Friday May 31, 2024, 3PM, online\\
**Kristopher Brown** (Topos Institute, Berkeley, California, USA) //A graphical language for programming with graph rewriting//
<button type="link" size="xs" collapse="b27-3777">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b27-3777" collapsed="true">
<well size="sm">
We provide a general introduction to the [[https://www.algebraicjulia.org/|AlgebraicJulia]] ecosystem and [[https://github.com/AlgebraicJulia/AlgebraicRewriting.jl|AlgebraicRewriting.jl]], which allows for integrating general-purpose code with computation of many graph transformation constructions in a broad variety of categories. Practical applications of graph transformation depend on being able to apply sequences of rewrites in a controlled manner: we present work on a graphical language for the construction and composition of such programs, including computation of normal forms as well as scientific agent-based model simulations. This graphical language can be given semantics in many different contexts (e.g. deterministic, nondeterministic, probabilistic) and can be functorially migrated, which yields graph rewriting programs that operate in other categories.



[[https://us06web.zoom.us/meeting/register/tZEqcOuvrzIqGdPlIz7H3uoxrgGW2OfOLNPB|Zoom meeting registration link]]

[[https://youtu.be/tTQa3lQyPL8|YouTube live stream]]
</well>
</collapse>


[[en:seminaires:greta:index|Graph Transformation Theory and Applications]]\\
Friday June 14, 2024, 3PM, online\\
**Adrian Rutle And Uwe Wolter** (Western Norway University; University of Bergen) //Multilevel Typed Graph Transformations//
<button type="link" size="xs" collapse="b27-3778">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b27-3778" collapsed="true">
<well size="sm">
Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are carried out by multilevel typed graph transformation rules. These rules are cospans of three graphs and two inclusion graph homomorphisms where the three graphs are multilevel typed over a common typing chain. In this paper, we show that typed graph transformations can be appropriately generalized to multilevel typed graph transformations improving preciseness, flexibility and reusability of transformation rules. We identify type compatibility conditions, for rules and their matches, formulated as equations and inequations, respectively, between composed partial typing morphisms. These conditions are crucial presuppositions for the application of a rule for a match—based on a pushout and a final pullback complement construction for the underlying graphs in the category —to always provide a well-defined canonical result in the multilevel typed setting. Moreover, to formalize and analyze multilevel typing as well as to prove the necessary results, in a systematic way, we introduce the category  of typing chains and typing chain morphisms.



[[https://us06web.zoom.us/meeting/register/tZ0uc-ivpzgoHdS7EZg68nP4OYHDthRe6bG7|Zoom meeting registration link]]

[[https://youtu.be/5au6VB7CX3g|YouTube live stream]]
</well>
</collapse>


\\ ==== Previous talks ====
\\ === Year 2024 ===

{{page>.:greta2024}}

\\ === Year 2023 ===

{{page>.:greta2023}}

\\ === Year 2022 ===

{{page>.:greta2022}}

\\ === Year 2021 ===

{{page>.:greta2021}}

\\ === Year 2020 ===

{{page>.:greta2020}}