Regular Papers

• Wojciech Czerwiński and Łukasz Orlikowski
  Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
  
• Duncan Adamson, Pamela Fleischmann, Annika Huch, Tim Löck, Dirk Nowotka and Christian Rauch
  Word-Representability of Directed Graphs
  
• Sully Mak, Guillaume Cantin and Benoît Delahaye
  Formal analysis of hybrid systems using parametric Statistical Model Checking
  
• Łukasz Kamiński and Sławomir Lasota
  Reachability in 3-VAS
  
• Domenico Cantone, Pietro Maugeri and Stefano Savino
  Decidability and NP-Completeness of Reachability-Sensitive Graph Constraints with Components, Acyclicity, and Ways
  
• Michael C. Chavrimootoo and Jin Seok Youn
  Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
  
• Catalin Dima, Mariem Hammami and Youssouf Oualhadj
  Logical and Strategic Preservation in Compact Rectangular Games
  
• Fabian Lehr and Florian Bruse
  Finite Convergence of the Modal $\mu$-Calculus on Almost Periodic Words
  
• Paul Bell, Eva Foster, Daniel Reidenbach and Pavel Semukhin
  Factorisability of Low Dimensional Non-Negative Integer Matrices
  
• Maxence Ponsardin and Ville Salo
  Thinking outside the box is useless
  
• Mikhail Volkov and Yinfeng Zhu
  Completely Reachable Road Coloring
  

Presentations

• Olivier Bournez, Johanne Cohen, Laura Cohen and Adrian Wurm
  Reachability in Constant-Width Neural Networks: from Turing-Machine Simulation to a Complete Complexity Classification
  
• Anton Varonka and Kazuki Watanabe
  On Piecewise Affine Reachability with Bellman Operators
  
• Gabriel Istrate
  Hypergraph Versions of Fates’s Asynchronous Parity Dynamics
  
• Piotr Bacik and Anton Varonka
  On the Subspace Orbit Problem and Simultaneous Skolem Problem
  
• Dietrich Kuske
  Boolean combinations of omega-rational trace languages: emptiness, rationality, regularity
  
• Karla Messing
  Witnesses for Fixpoint Games on Lattices (informal presentation)
  
• Piotr Bacik, Joris Nieuvweld, Joël Ouaknine, Mihir Vahanwala, Madhavan Venkatesh and Emil Rugaard Wieser
  On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
  
• Tymofii Prokopenko
  Cops and Robbers on Graphs Under Zero-Visibility Constraints
  
• Nicole Schirrmacher
  Logics Between FO and CMSO: Expressive Power and Model Checking
  
• Filip Cano, Thomas Henzinger, Konstantin Kueffner and Ege Saraç
  Monitoring Discounted Sum Properties
  
• Irmak Saglam
  Infinite-state games with energy objectives beyond counters
  
• Katariina Paturi
  Minimality, transitivity and sensitivity of non-uniform cellular automata