RP24: INTERNATIONAL CONFERENCE ON REACHABILITY PROBLEMS 2024

A
Adamson, Duncan	Rollercoasters with Plateaus
Ait El Manssour, Rida	Simple Linear Loops: Algebraic Invariants and Synthesis
Akshay, S.	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Anand, Ashwani	Verifying Unboundedness via Amalgamation
Aoto, Takahito	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
Asadi, Ali	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Avni, Guy	Bidding Games with Charging
B
Bartocci, Ezio	Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach
Benso, Andrea	Quantum automata and languages of finite index
Berthon, Raphaël	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Boker, Udi	Safety and Liveness of Quantitative Properties and Automata
Bruse, Florian	The Calculus of Dual Influence Computing All Minimal Ways to Reach a Context-Free Language
C
Cano, Filip	Abstraction-Based Decision Making for Statistical Properties
Chatterjee, Krishnendu	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Cohen, Johanne	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
D
D'Onofrio, Alberto	Exploring Consensus Robustness in Swarms with Disruptive Individuals
Dalessandro, Flavio	Quantum automata and languages of finite index
F
Fleischmann, Pamela	Rollercoasters with Plateaus
Frehse, Goran	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
G
Ganty, Pierre	Computing Reachable Simulations on Transition Systems
Gastin, Paul	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Goutierre, Emmanuel	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
Govind, R	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Guilmant, Quentin	Innaproximability in Weighted Timed Games The 2-Dimensional Constraint Loop Problem is Decidable
Guler, Hayg	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
H
Hartmanns, Arnd	The Revised Practitioner's Guide to MDP Model Checking Algorithms
Henzinger, Thomas	Safety and Liveness of Quantitative Properties and Automata
Henzinger, Thomas A.	Bidding Games with Charging Abstraction-Based Decision Making for Statistical Properties
Hirvensalo, Mika	Reachability in Linear Recurrence Automata
Huch, Annika	Rollercoasters with Plateaus
I
Iwami, Munehiro	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
J
Junges, Sebastian	The Revised Practitioner's Guide to MDP Model Checking Algorithms
K
Kafshdar Goharshady, Ehsan	Bidding Games with Charging
Kapotos, Fotios	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
Katoen, Joost-Pieter	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives Programmatic Synthesis for Infinite MDPs Using Program Refinement
Kawamura, Akitoshi	Reachability in Linear Recurrence Automata
Kenison, George	The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters Simple Linear Loops: Algebraic Invariants and Synthesis
Kincaid, Zachary	Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability
Klein, Julia	Exploring Consensus Robustness in Swarms with Disruptive Individuals
Kojima, Misaki	On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness
Kovacs, Laura	Welcome to RP 2024!
Kucera, Antonin	The Satisfiability and Validity Problems for Probabilistic CTL
Kueffner, Konstantin	Abstraction-Based Decision Making for Statistical Properties
Könighofer, Bettina	Abstraction-Based Decision Making for Statistical Properties
L
Lange, Martin	The Calculus of Dual Influence Computing All Minimal Ways to Reach a Context-Free Language
Lefaucheux, Engel	The 2-Dimensional Constraint Loop Problem is Decidable
Li, Sida-Bastien	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
Loff, Bruno	Smoothed analysis of deterministic discounted and mean-payoff games
M
Mallik, Kaushik	Bidding Games with Charging Abstraction-Based Decision Making for Statistical Properties
Manini, Nicolas	Computing Reachable Simulations on Transition Systems
Mauser, Norbert	Welcome to RP 2024!
Mazzocchi, Nicolas	Safety and Liveness of Quantitative Properties and Automata
Meggendorfer, Tobias	Playing Games with your PET: Solving Stochastic Games, Reliably
Möller, Sören	The Calculus of Dual Influence
N
Nishida, Naoki	On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness
O
Ouaknine, Joël	Innaproximability in Weighted Timed Games The 2-Dimensional Constraint Loop Problem is Decidable
P
Papi, Paolo	Quantum automata and languages of finite index
Petrov, Tatjana	Exploring Consensus Robustness in Swarms with Disruptive Individuals
Pimpalkhare, Nikhil	Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability
Piskac, Ruzica	Proofs as Polynomials
Potapov, Igor	Reachability in Linear Recurrence Automata
Priser, Gwendal	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
Q
Quatmann, Tim	The Revised Practitioner's Guide to MDP Model Checking Algorithms
R
Ranzato, Francesco	Computing Reachable Simulations on Transition Systems
Ryzhikov, Andrew	On shortest products for nonnegative matrix mortality
S
Saona Urmeneta, Raimundo	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Saraç, N. Ege	Safety and Liveness of Quantitative Properties and Automata
Schmitz, Sylvain	Verifying Unboundedness via Amalgamation
Schütze, Lia	Verifying Unboundedness via Amalgamation
Shirmohammadi, Mahsa	Simple Linear Loops: Algebraic Invariants and Synthesis
Skomra, Mateusz	Smoothed analysis of deterministic discounted and mean-payoff games
Sokolova, Ana	Welcome to RP 2024!
Srivathsan, B	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Stérin, Tristan	Hardness of busy beaver value BB(15)
Svoboda, Jakub	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Sébag, Michèle	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
T
Thejaswini, K. S.	Solving Parity and Rabin games by Constructing Universal Trees
Tveretina, Olga	On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps
V
Vanneaux, Elena	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
Varonka, Anton	Simple Linear Loops: Algebraic Invariants and Synthesis
W
Weininger, Maximilian	The Revised Practitioner's Guide to MDP Model Checking Algorithms Playing Games with your PET: Solving Stochastic Games, Reliably
Winkler, Tobias	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Woods, Damien	Hardness of busy beaver value BB(15)
Worell, James	The 2-Dimensional Constraint Loop Problem is Decidable
Y
Yuyama, Takao	Reachability in Linear Recurrence Automata
Z
Zetzsche, Georg	Verifying Unboundedness via Amalgamation
Zhu, Bowen	Modelling dynamical systems: Learning ODEs with no internal ODE resolution

Disclaimer | Powered by EasyChair Smart Program