schedule

DAYTIMESPEAKERTALK TITLE
Sunday9.30am  
 2pmRanko LazicPetri Nets Reach- ability Problem
 4pmJean-Baptiste
Jeannin
Implicit and Explicit Formulations of Safety
Buffers along Trajectories
Monday9.30amMaria BrunaMulti-scale
modeling of
interacting
particle systems
 2pmMichael
Cadilhac
The equivalence
of cost register
automata is un-
decidable, even in very weak
settings
 4pmChristian
Ikenmeyer
Open problems in algebraic and
geometric
complexity
theory
Tuesday9.30amGrant RotskoffNeural networks, interacting particle systems, and
convergence of
optimization
dynamics
 2pmEngel
Lefaucheux
Skolem meets
Riemann
 4pmBenjamin
Kaminski
Aiming Low Is
Harder-Induction
Rules for Lower
Bounds on
Weakest
Preexpectations
Wednesday9.30amJoël OuaknineInvariants for
linear systems
2pm Excursion
Thursday9.30amReino NiskanenOn relative
decidability of
synchronous and recognizable

relations
 2pmToni HotanenEntropy for endomorphisms of measure-
preserving dynamical systems
 4pmRichard MayrMarkov
Decision
Processes and
Stochastic
Games on
Infinite Arenas
Friday9amGeorge
Kenison
Skolem’s
Problem and

prime powers
 11amPeter TapioIntersections of
art and science –
towards
voyeurist math

1-8 June 2019