{"id":43,"date":"2026-04-06T10:13:35","date_gmt":"2026-04-06T10:13:35","guid":{"rendered":"https:\/\/math.utu.fi\/rp26\/?page_id=43"},"modified":"2026-08-20T07:29:21","modified_gmt":"2026-08-20T07:29:21","slug":"program","status":"publish","type":"page","link":"https:\/\/math.utu.fi\/rp26\/program\/","title":{"rendered":"Program"},"content":{"rendered":"\n
<\/span>Invited talk (60 min)<\/span><\/span>Regular paper (30 min) <\/span><\/span>Presentation only (20 min)<\/span>\n <\/span>\n Best Paper Award\n<\/span><\/div>

Wednesday October 21<\/h2>
09:30<\/div>
TBA<\/div>
James Worrell<\/div>
<\/div><\/div><\/div>
10:30<\/div>
Coffee break<\/div><\/div>
11:00<\/div>
Formal analysis of hybrid systems using parametric Statistical Model Checking<\/div>
Sully Mak, Guillaume Cantin and Beno\u00eet Delahaye<\/div>
<\/div><\/div><\/div>
11:30<\/div>
Logical and Strategic Preservation in Compact Rectangular Games<\/div>
Catalin Dima, Mariem Hammami and Youssouf Oualhadj<\/div>
<\/div><\/div><\/div>
12:00<\/div>
Finite Convergence of the Modal \u03bc-Calculus on Almost Periodic Words<\/div>
Fabian Lehr and Florian Bruse<\/div>
<\/div><\/div><\/div>
12:30<\/div>
Lunch break<\/div><\/div>
14:00<\/div>
Timed reachability in logic<\/div>
Antti Kuusisto<\/div>
<\/div><\/div><\/div>
15:00<\/div>
Coffee break<\/div><\/div>
15:30<\/div>
Witnesses for Fixpoint Games on Lattices <\/div>
Karla Messing<\/div><\/div><\/div>
15:50<\/div>
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic<\/div>
Piotr Bacik, Joris Nieuvweld, Jo\u00ebl Ouaknine, Mihir Vahanwala, Madhavan Venkatesh and Emil Rugaard Wieser<\/div>
<\/div><\/div><\/div>
16:10<\/div>
Logics Between FO and CMSO: Expressive Power and Model Checking<\/div>
Nicole Schirrmacher<\/div>
<\/div><\/div><\/div>
16:30<\/div>
Monitoring Discounted Sum Properties<\/div>
Filip Cano, Thomas Henzinger, Konstantin Kueffner and Ege Sara\u00e7<\/div>
<\/div><\/div><\/div>

Thursday October 22<\/h2>
09:30<\/div>
Reachability Problems Arising from Mixing Properties of Shift Spaces<\/div>
Ilkka T\u00f6rm\u00e4<\/div>
<\/div><\/div><\/div>
10:30<\/div>
Coffee break<\/div><\/div>
11:00<\/div>
Word-Representability of Directed Graphs<\/div>
Duncan Adamson, Pamela Fleischmann, Annika Huch, Tim L\u00f6ck, Dirk Nowotka and Christian Rauch<\/div>
<\/div><\/div><\/div>
11:30<\/div>
Thinking outside the box is useless<\/div>
Maxence Ponsardin and Ville Salo<\/div>
<\/div><\/div><\/div>
12:00<\/div>
Completely Reachable Road Coloring<\/div>
Mikhail Volkov and Yinfeng Zhu<\/div>
<\/div><\/div><\/div>
12:30<\/div>
Lunch break<\/div><\/div>
14:00<\/div>
Decidability and NP-Completeness of Reachability-Sensitive Graph Constraints with Components, Acyclicity, and Ways<\/div>
Domenico Cantone, Pietro Maugeri and Stefano Savino<\/div>
<\/div><\/div><\/div>
14:30<\/div>
Factorisability of Low Dimensional Non-Negative Integer Matrices<\/div>
Paul Bell, Eva Foster, Daniel Reidenbach and Pavel Semukhin<\/div>
<\/div><\/div><\/div>
15:00<\/div>
Coffee break<\/div><\/div>
15:30<\/div>
Hypergraph Versions of Fates’s Asynchronous Parity Dynamics<\/div>
Gabriel Istrate<\/div>
<\/div><\/div><\/div>
15:50<\/div>
Boolean combinations of \u03c9-rational trace languages: emptiness, rationality, regularity<\/div>
Dietrich Kuske<\/div>
<\/div><\/div><\/div>
16:10<\/div>
Cops and Robbers on Graphs Under Zero-Visibility Constraints<\/div>
Tymofii Prokopenko<\/div>
<\/div><\/div><\/div>
16:30<\/div>
Minimality, transitivity and sensitivity of non-uniform cellular automata<\/div>
Katariina Paturi<\/div>
<\/div><\/div><\/div>
18:30<\/div>
Conference dinner<\/div><\/div>\n

Friday October 23<\/h2>
09:30<\/div>
TBA<\/div>
Igor Potapov<\/div><\/div><\/div>
10:30<\/div>
Coffee break<\/div><\/div>
11:00<\/div>
Reachability in 3-VAS<\/div>
\u0141ukasz Kami\u0144ski and S\u0142awomir Lasota<\/div><\/div><\/div>
11:30<\/div>
Language Equivalence is Undecidable in VASS with Restricted Nondeterminism<\/div>
Wojciech Czerwi\u0144ski and \u0141ukasz Orlikowski<\/div><\/div><\/div>
12:00<\/div>
Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles<\/div>
Michael C. Chavrimootoo and Jin Seok Youn<\/div><\/div><\/div>
12:30<\/div>
Lunch break<\/div><\/div>
14:00<\/div>
Loop to Reach Solvability<\/div>
Laura Kov\u00e1cs<\/div><\/div><\/div>
15:00<\/div>
Coffee break<\/div><\/div>
15:30<\/div>
Reachability in Constant-Width Neural Networks: from Turing-Machine Simulation to a Complete Complexity Classification<\/div>
Olivier Bournez, Johanne Cohen, Laura Cohen and Adrian Wurm<\/div><\/div><\/div>
15:50<\/div>
On Piecewise Affine Reachability with Bellman Operators<\/div>
Anton Varonka and Kazuki Watanabe<\/div><\/div><\/div>
16:10<\/div>
On the Subspace Orbit Problem and Simultaneous Skolem Problem<\/div>
Piotr Bacik and Anton Varonka<\/div><\/div><\/div>
16:30<\/div>
Infinite-state games with energy objectives beyond counters<\/div>
Irmak Saglam<\/div><\/div><\/div><\/div>\n","protected":false},"excerpt":{"rendered":"

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\u00eet Delahaye 11:30 Logical and Strategic Preservation in Compact Rectangular Games Catalin Dima, Mariem Hammami […]<\/p>\n","protected":false},"author":38,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-43","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/43","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/users\/38"}],"replies":[{"embeddable":true,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/comments?post=43"}],"version-history":[{"count":11,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/43\/revisions"}],"predecessor-version":[{"id":162,"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/pages\/43\/revisions\/162"}],"wp:attachment":[{"href":"https:\/\/math.utu.fi\/rp26\/wp-json\/wp\/v2\/media?parent=43"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}