Del 15050 - Lecture Notes in Computer Science

Reachability Problems

18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings

Häftad, Engelska, 2024

Av Laura Kovács, Ana Sokolova, Laura Kovacs

819 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25–27, 2024.The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.

Produktinformation

Utgivningsdatum2024-09-20
Mått155 x 235 x 15 mm
Vikt411 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor239
FörlagSpringer International Publishing AG
ISBN9783031726200

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programvaruutveckling inom Data och it
Artificiell intelligens inom Data och it

Invited Papers.- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach.-The Satis ability and Validity Problems for Probabilistic CTL.-Computability and Reachability.- Computing Reachable Simulations on Transition Systems.- Computing All Minimal Ways to Reach a Context-Free Language.- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness.- Automata and Complexity.- Rollercoasters with Plateaus.- Quantum Automata and Languages of Finite Index.- On Shortest Products for Nonnegative Matrix Mortality.- Hardness of Busy Beaver Value BB(15).- Linear Systems and Recurrences.- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps.- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability.-Reachability in Linear Recurrence Automata.- Games and Abstractions.- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems.- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives.- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.