04259nam a22006255i 4500 978-3-031-72621-7 DE-He213 20251030113055.0 cr nn 008mamaa 240919s2024 sz | s |||| 0|eng d 9783031726217 978-3-031-72621-7 10.1007/978-3-031-72621-7 doi QA267-268.5 UYA bicssc COM014000 bisacsh UYA thema Reachability Problems [electronic resource] : 18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings / edited by Laura Kovács, Ana Sokolova. 1st ed. 2024. Cham : Springer Nature Switzerland : Imprint: Springer, 2024. XXVI, 239 p. 31 illus., 15 illus. in color. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Lecture Notes in Computer Science, 1611-3349 ; 15050 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. 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. Machine theory. 67305 Computer science. 58552 Software engineering. 33953 Logic programming. 66664 Algorithms. 58677 Computer science Mathematics. 64041 Formal Languages and Automata Theory. 67306 Computer Science Logic and Foundations of Programming. 68173 Software Engineering. 33953 Logic in AI. 66665 Design and Analysis of Algorithms. 67299 Mathematics of Computing. 66501 Kovács, Laura. editor. (orcid)0000-0002-8299-2714 https://orcid.org/0000-0002-8299-2714 edt http://id.loc.gov/vocabulary/relators/edt 81915 Sokolova, Ana. editor. (orcid)0000-0002-8384-3438 https://orcid.org/0000-0002-8384-3438 edt http://id.loc.gov/vocabulary/relators/edt 84690 SpringerLink (Online service) Springer Nature eBook Printed edition: 9783031726200 Printed edition: 9783031726224 Lecture Notes in Computer Science, 1611-3349 ; 15050 https://doi.org/10.1007/978-3-031-72621-7 ZDB-2-SCS ZDB-2-SXCS ZDB-2-LNC 63556 63556