Invited talk (60 min)Regular paper (30 min) Presentation only (20 min)
Best Paper Award
Wednesday October 21
09:30
TBA
James Worrell
10:30
Coffee break
11:00
Formal analysis of hybrid systems using parametric Statistical Model Checking
Sully Mak, Guillaume Cantin and Benoît Delahaye
11:30
Logical and Strategic Preservation in Compact Rectangular Games
Catalin Dima, Mariem Hammami and Youssouf Oualhadj
12:00
Finite Convergence of the Modal μ-Calculus on Almost Periodic Words
Fabian Lehr and Florian Bruse
12:30
Lunch break
14:00
Timed reachability in logic
Antti Kuusisto
15:00
Coffee break
15:30
Witnesses for Fixpoint Games on Lattices
Karla Messing
15:50
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
Piotr Bacik, Joris Nieuvweld, Joël Ouaknine, Mihir Vahanwala, Madhavan Venkatesh and Emil Rugaard Wieser
16:10
Logics Between FO and CMSO: Expressive Power and Model Checking
Nicole Schirrmacher
16:30
Monitoring Discounted Sum Properties
Filip Cano, Thomas Henzinger, Konstantin Kueffner and Ege Saraç
Thursday October 22
09:30
Reachability Problems Arising from Mixing Properties of Shift Spaces
Ilkka Törmä
10:30
Coffee break
11:00
Word-Representability of Directed Graphs
Duncan Adamson, Pamela Fleischmann, Annika Huch, Tim Löck, Dirk Nowotka and Christian Rauch
11:30
Thinking outside the box is useless
Maxence Ponsardin and Ville Salo
12:00
Completely Reachable Road Coloring
Mikhail Volkov and Yinfeng Zhu
12:30
Lunch break
14:00
Decidability and NP-Completeness of Reachability-Sensitive Graph Constraints with Components, Acyclicity, and Ways
Domenico Cantone, Pietro Maugeri and Stefano Savino
14:30
Factorisability of Low Dimensional Non-Negative Integer Matrices
Paul Bell, Eva Foster, Daniel Reidenbach and Pavel Semukhin
15:00
Coffee break
15:30
Hypergraph Versions of Fates’s Asynchronous Parity Dynamics
Gabriel Istrate
15:50
Boolean combinations of ω-rational trace languages: emptiness, rationality, regularity
Dietrich Kuske
16:10
Cops and Robbers on Graphs Under Zero-Visibility Constraints
Tymofii Prokopenko
16:30
Minimality, transitivity and sensitivity of non-uniform cellular automata
Katariina Paturi
18:30
Conference dinner
Friday October 23
09:30
TBA
Igor Potapov
10:30
Coffee break
11:00
Reachability in 3-VAS
Łukasz Kamiński and Sławomir Lasota
11:30
Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
Wojciech Czerwiński and Łukasz Orlikowski
12:00
Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
Michael C. Chavrimootoo and Jin Seok Youn
12:30
Lunch break
14:00
Loop to Reach Solvability
Laura Kovács
15:00
Coffee break
15:30
Reachability in Constant-Width Neural Networks: from Turing-Machine Simulation to a Complete Complexity Classification
Olivier Bournez, Johanne Cohen, Laura Cohen and Adrian Wurm
15:50
On Piecewise Affine Reachability with Bellman Operators
Anton Varonka and Kazuki Watanabe
16:10
On the Subspace Orbit Problem and Simultaneous Skolem Problem
Piotr Bacik and Anton Varonka
16:30
Infinite-state games with energy objectives beyond counters
Irmak Saglam