03839nam a22005295i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003500118050001600153072001600169072002300185072001500208245018900223250001800412264006900430300006600499336002600565337002600591338003600617347002400653490005900677505116600736520052701902650002002429650002202449650002602471650002302497650001602520650003502536650004202571650005902613650002602672650001702698650003902715650003002754700014502784700014302929710003403072773002603106776003603132776003603168830005903204856004603263978-3-031-72621-7DE-He21320251030113055.0cr nn 008mamaa240919s2024    sz |    s    |||| 0|eng d  a97830317262177 a10.1007/978-3-031-72621-72doi 4aQA267-268.5 7aUYA2bicssc 7aCOM0140002bisacsh 7aUYA2thema10aReachability Problemsh[electronic resource] :b18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings /cedited by Laura Kovács, Ana Sokolova.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXXVI, 239 p. 31 illus., 15 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aLecture Notes in Computer Science,x1611-3349 ;v150500 aInvited 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.  aThis 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. 0aMachine theory. 0aComputer science. 0aSoftware engineering. 0aLogic programming. 0aAlgorithms. 0aComputer sciencexMathematics.14aFormal Languages and Automata Theory.24aComputer Science Logic and Foundations of Programming.24aSoftware Engineering.24aLogic in AI.24aDesign and Analysis of Algorithms.24aMathematics of Computing.1 aKovács, Laura.eeditor.0(orcid)0000-0002-8299-27141https://orcid.org/0000-0002-8299-27144edt4http://id.loc.gov/vocabulary/relators/edt1 aSokolova, Ana.eeditor.0(orcid)0000-0002-8384-34381https://orcid.org/0000-0002-8384-34384edt4http://id.loc.gov/vocabulary/relators/edt2 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303172620008iPrinted edition:z9783031726224 0aLecture Notes in Computer Science,x1611-3349 ;v1505040uhttps://doi.org/10.1007/978-3-031-72621-7