Commit b1f61332 authored by Quentin Aristote's avatar Quentin Aristote
Browse files

add jeremy as supervisor

parent 959b7a3b
......@@ -70,7 +70,7 @@ In many cases finding under-approximations of the bisimulation is enough, as, fo
Members of the \href{https://group-mmm.org/eratommsd/about-2/}{Erato MMSD Project}, introduced a category theoretical framework, codensity liftings, which instantiates many different notions of bisimulation~\cite{sprungerFibrationalBisimulationsQuantitative2018}. Using this framework, a categorical link between bisimulations and game theory was then established by introducing the codensity safety game that characterizes these notions of bisimulation~\cite{komoridaCodensityGamesBisimilarity2019a}. Altough the categorical setting allows for the definition of new bisimilarity-like notions, these works only deal with bisimulations that can be expressed as greatest fixed point, which is not enough for complex acceptance conditions. For example, the fair and delayed bisimulations fail to be instantiated by this framework as they are characterized by parity games, i.e.\ nested alternating fixed points~\cite{hasuoLatticetheoreticProgressMeasures2016}.
\paragraph{Goals.}
During my internship, under the supervision of \href{https://group-mmm.org/~ichiro/}{Ichiro Hasuo}, I thus visited the T\=oky\=o site of the Erato MMSD Project in order to extend these previous works to nested alternating fixed points, by characterizing their under-approximants as winning positions in well-crafted games. The hope was then that this would enable generalizations of fair and delayed (bi)simulations, in particular to bisimulation distances for B\"uchi-like probabilistic transition systems.
During my internship, under the supervision of \href{https://group-mmm.org/~ichiro/}{Ichiro Hasuo} and \href{https://group-mmm.org/~dubut/}{J\'er\'emy Dubut}, I thus visited the T\=oky\=o site of the Erato MMSD Project in order to extend these previous works to nested alternating fixed points, by characterizing their under-approximants as winning positions in well-crafted games. The hope was then that this would enable generalizations of fair and delayed (bi)simulations, in particular to bisimulation distances for B\"uchi-like probabilistic transition systems.
% \paragraph{Structure.}
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment