LEADER 04027nam  22007215  450 
001 9910887816903321
005 20251225202045.0
010   $a3-031-72621-9
024 7 $a10.1007/978-3-031-72621-7
035   $a(MiAaPQ)EBC31683202
035   $a(Au-PeEL)EBL31683202
035   $a(CKB)36129182800041
035   $a(DE-He213)978-3-031-72621-7
035   $a(EXLCZ)9936129182800041
100   $a20240919d2024      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aReachability Problems $e18th International Conference, RP 2024, Vienna, Austria, September 25?27, 2024, Proceedings /$fedited by Laura Kovács, Ana Sokolova
205   $a1st ed. 2024.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024.
215   $a1 online resource (251 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15050
311 08$a3-031-72620-0 
327   $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.
330   $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.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v15050
606   $aMachine theory
606   $aComputer science
606   $aSoftware engineering
606   $aLogic programming
606   $aAlgorithms
606   $aComputer science$xMathematics
606   $aFormal Languages and Automata Theory
606   $aComputer Science Logic and Foundations of Programming
606   $aSoftware Engineering
606   $aLogic in AI
606   $aDesign and Analysis of Algorithms
606   $aMathematics of Computing
615  0$aMachine theory.
615  0$aComputer science.
615  0$aSoftware engineering.
615  0$aLogic programming.
615  0$aAlgorithms.
615  0$aComputer science$xMathematics.
615 14$aFormal Languages and Automata Theory.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aSoftware Engineering.
615 24$aLogic in AI.
615 24$aDesign and Analysis of Algorithms.
615 24$aMathematics of Computing.
676   $a004.0151
702   $aKova?cs$b Laura
702   $aSokolova$b Ana
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910887816903321
996   $aReachability Problems$93573647
997   $aUNINA