RP24: INTERNATIONAL CONFERENCE ON REACHABILITY PROBLEMS 2024
SLIDES

Hardness of Busy Beaver Value BB(15)

Tristan Stérin and Damien Woods

Abstraction-Based Decision Making for Statistical Properties

Filip Cano, Thomas A. Henzinger, Bettina Könighofer, Konstantin Kueffner and Kaushik Mallik

Markov Decision Processes with Sure Parity and Multiple Reachability Objectives

Raphaël Berthon, Joost-Pieter Katoen and Tobias Winkler

Computing All Minimal Ways to Reach a Context-Free Language

Florian Bruse and Martin Lange

Computing Reachable Simulations on Transition Systems

Pierre Ganty, Nicolas Manini and Francesco Ranzato

The Calculus of Dual Influence

Florian Bruse, Martin Lange and Sören Möller

Programmatic Synthesis for Infinite MDPs Using Program Refinement

Joost-Pieter Katoen

Verifying Unboundedness via Amalgamation

Ashwani Anand, Sylvain Schmitz, Lia Schütze and Georg Zetzsche

Bidding Games with Charging

Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger and Kaushik Mallik

Semi-Linear VASR for over-Approximate Semi-Linear System Reachability

Nikhil Pimpalkhare and Zachary Kincaid

On Shortest Products for Nonnegative Matrix Mortality

Andrew Ryzhikov

Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution

Bowen Zhu, Fotios Kapotos, Sida-Bastien Li, Emmanuel Goutierre, Johanne Cohen, Hayg Guler and Michèle Sébag

Teaching Your PETS: Should I Stay or Should I Go?

Tobias Meggendorfer and Maximilian Weininger

Rollercoasters with Plateaus

Duncan Adamson, Pamela Fleischmann and Annika Huch

Deterministic Sub-Exponential Algorithm for Discounted-Sum Games with Unary Weights

Ali Asadi, Krishnendu Chatterjee, Jakub Svoboda and Raimundo Saona Urmeneta

On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness

Misaki Kojima and Naoki Nishida
Total: 16 presentations.