RP24: INTERNATIONAL CONFERENCE ON REACHABILITY PROBLEMS 2024

This page contains an index consisting of author-provided keywords.

$
$k$-Rollercoaster	Rollercoasters with Plateaus
(
(Longest Common) Subsequences	Rollercoasters with Plateaus
A
Abstract interpretation	Abstraction-Based Decision Making for Statistical Properties
Algebraic groups of matrices	Quantum automata and languages of finite index
algebraic invariant	Simple Linear Loops: Algebraic Invariants and Synthesis
algebraic reasoning	Simple Linear Loops: Algebraic Invariants and Synthesis
approximation	Inaproximability in Weighted Timed Games
Asymptotic Expansions	The 2-Dimensional Constraint Loop Problem is Decidable
automata theory	Solving Parity and Rabin games by Constructing Universal Trees
automated reasoning	Proofs as Polynomials
B
Bidding Games on Graphs	Bidding Games with Charging
blockchain	Proofs as Polynomials
Busy beaver	Hardness of busy beaver value BB(15)
C
Collective Decision Making	Exploring Consensus Robustness in Swarms with Disruptive Individuals
complexity	On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps Welcome to RP 2024!
constrained rewriting	On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness
Context-free languages	Quantum automata and languages of finite index
continous deep learning model	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
continuous dynamical systems	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
Convex Sets	The 2-Dimensional Constraint Loop Problem is Decidable
Counter machines	Abstraction-Based Decision Making for Statistical Properties
cyclic proof	On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness
D
Decidability	Quantum automata and languages of finite index
Deterministic Sub-exponential Algorithms	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Discounted games	Smoothed analysis of deterministic discounted and mean-payoff games
Discounted-sum Objectives	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
discrete abstraction	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
downward closure	Verifying Unboundedness via Amalgamation
E
edit distance	Computing All Minimal Ways to Reach a Context-Free Language
Enumeration	Rollercoasters with Plateaus
Erdős conjecture	Hardness of busy beaver value BB(15)
Euclidean geometry	The Calculus of Dual Influence
F
Fixpoint Algorithms	Bidding Games with Charging
formal languages	Computing All Minimal Ways to Reach a Context-Free Language
formal methods	The Satisfiability and Validity Problems for Probabilistic CTL
formal reasoning	The Calculus of Dual Influence
H
Hypergeometric Sequences	The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters
I
Infinitary term rewriting	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
Infinite State System Reachability	Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability
L
Learning	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
Linear Constraints Loops	The 2-Dimensional Constraint Loop Problem is Decidable
Linear Integer Arithmetic	Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability
Linear programming	The Revised Practitioner's Guide to MDP Model Checking Algorithms
Linear recurrences	Reachability in Linear Recurrence Automata
Liveness	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm Safety and Liveness of Quantitative Properties and Automata
loop invariant	Simple Linear Loops: Algebraic Invariants and Synthesis
loop invariants	Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach
M
Markov decision process	The Revised Practitioner's Guide to MDP Model Checking Algorithms
Markov decision processes	Programmatic Synthesis for Infinite MDPs Using Program Refinement
matrix mortality	On shortest products for nonnegative matrix mortality
Matrix Semigroups	Reachability in Linear Recurrence Automata
MDPs	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Mean-payoff games	Smoothed analysis of deterministic discounted and mean-payoff games
Membership Problem	The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters
Minkowski-Weyl	The 2-Dimensional Constraint Loop Problem is Decidable
MITL model checking	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Model checker	Playing Games with your PET: Solving Stochastic Games, Reliably
modelling dynamic systems	The Calculus of Dual Influence
Mortality problem	On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps
Multi-objective	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
N
NFA mortality	On shortest products for nonnegative matrix mortality
nonnegative matrices	On shortest products for nonnegative matrix mortality
O
Omega-Regular Objectives	Bidding Games with Charging
ordinary differential equation	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
P
Parametrized Algorithms	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
Parity	Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
parity games	Solving Parity and Rabin games by Constructing Universal Trees
Partial exploration	Playing Games with your PET: Solving Stochastic Games, Reliably
PCTL	The Satisfiability and Validity Problems for Probabilistic CTL
Plateaus	Rollercoasters with Plateaus
Policy iteration	Smoothed analysis of deterministic discounted and mean-payoff games The Revised Practitioner's Guide to MDP Model Checking Algorithms
polynomial space	Simple Linear Loops: Algebraic Invariants and Synthesis
probabilistic reasoning	Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach
Probabilistic verification	Playing Games with your PET: Solving Stochastic Games, Reliably
program refinement	Programmatic Synthesis for Infinite MDPs Using Program Refinement
program synthesis	Simple Linear Loops: Algebraic Invariants and Synthesis
program verification	Programmatic Synthesis for Infinite MDPs Using Program Refinement On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness
proofs	Proofs as Polynomials Welcome to RP 2024!
Q
quantitative automata	Safety and Liveness of Quantitative Properties and Automata
Quantitative model checking	The Revised Practitioner's Guide to MDP Model Checking Algorithms
quantitative properties	Safety and Liveness of Quantitative Properties and Automata
Quantum automata	Quantum automata and languages of finite index
R
Rabin games	Solving Parity and Rabin games by Constructing Universal Trees
Rational terms	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
Reachability	Programmatic Synthesis for Infinite MDPs Using Program Refinement Computing Reachable Simulations on Transition Systems Markov Decision Processes with Sure Parity and Multiple Reachability Objectives Reachability in Linear Recurrence Automata Welcome to RP 2024!
Reachability problem	On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps
Reachable Simulation Problem	Computing Reachable Simulations on Transition Systems
robustness	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
S
safety	Safety and Liveness of Quantitative Properties and Automata
satisfiability	The Satisfiability and Validity Problems for Probabilistic CTL
Scattered Factors	Rollercoasters with Plateaus
security	Proofs as Polynomials
separability	Verifying Unboundedness via Amalgamation
Sequential decision making	Abstraction-Based Decision Making for Statistical Properties
Simulation	Computing Reachable Simulations on Transition Systems
Simulation algorithm	Computing Reachable Simulations on Transition Systems
simultaneous unboundedness	Verifying Unboundedness via Amalgamation
Smoothed analysis	Smoothed analysis of deterministic discounted and mean-payoff games
Statistical Model Checking	Exploring Consensus Robustness in Swarms with Disruptive Individuals
Stochastic games	Playing Games with your PET: Solving Stochastic Games, Reliably
Strategy iteration algorithm	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
supervision	Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems
Swarm Robotics	Exploring Consensus Robustness in Swarms with Disruptive Individuals
Symbolic Data Structure	Computing Reachable Simulations on Transition Systems
T
term rewriting	Computing All Minimal Ways to Reach a Context-Free Language
Term rewriting systems	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
Threshold Problem	The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters
Timed automata	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm
Top-down tree transducers	Preservation of Rationality in Infinitary Rewriting by Top-Down Tree Transducers
Turing machines	Hardness of busy beaver value BB(15)
Turn-based games	Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights
U
undecidability	Inaproximability in Weighted Timed Games
Universal Approximation theorem	Modelling dynamical systems: Learning ODEs with no internal ODE resolution
universal trees	Solving Parity and Rabin games by Constructing Universal Trees
V
valence systems	Verifying Unboundedness via Amalgamation
Value iteration	The Revised Practitioner's Guide to MDP Model Checking Algorithms
vector addition system	Verifying Unboundedness via Amalgamation
Vector Addition Systems	Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability
verification	Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach The Satisfiability and Validity Problems for Probabilistic CTL Verifying Unboundedness via Amalgamation
W
Weighted timed games	Inaproximability in Weighted Timed Games
well-quasi-order	Verifying Unboundedness via Amalgamation
Z
Zariski closure	Simple Linear Loops: Algebraic Invariants and Synthesis
Zones	MITL Model Checking via Generalized Timed Automata and a new Liveness Algorithm

Disclaimer | Powered by EasyChair Smart Program