LEADER 04043nam  22007575  450 
001 9910746959803321
005 20231004102043.0
010   $a3-031-45286-0
024 7 $a10.1007/978-3-031-45286-4
035   $a(MiAaPQ)EBC30771294
035   $a(Au-PeEL)EBL30771294
035   $a(DE-He213)978-3-031-45286-4
035   $a(PPN)272913804
035   $a(CKB)28461822200041
035   $a(EXLCZ)9928461822200041
100   $a20231004d2023      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aReachability Problems $e17th International Conference, RP 2023, Nice, France, October 11?13, 2023, Proceedings /$fedited by Olivier Bournez, Enrico Formenti, Igor Potapov
205   $a1st ed. 2023.
210  1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023.
215   $a1 online resource (231 pages)
225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14235
311 08$aPrint version: Bournez, Olivier Reachability Problems Cham : Springer International Publishing AG,c2023 9783031452857 
320   $aIncludes bibliographical references and index.
327   $aInvited Papers -- Randomness quality and trade-offs for CA random string generators -- Regular Papers -- Complexity of Reachability Problems in Neural Networks -- Weakly synchronous systems with three machines are Turing powerful -- On the Identity and Group Problems for Complex Heisenberg Matrices -- Reachability analysis of a class of hybrid gene regulatory networks -- Quantitative Reachability Stackelberg-Pareto Synthesis -- Multi-Weighted Reachability Games -- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions -- Adaptive Directions for Bernstein-based Polynomial Set Evolution -- Introducing Divergence for Infinite Probabilistic Models -- A Framework for the Competitive Analysis of Model Predictive Controllers -- Matching Patterns with Variables Under Simon?s Congruence -- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification -- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.
330   $aThis book constitutes the refereed proceedings of the 17th International Conference on Reachability Problems, RP 2023, held in Nice, France, during October 11?13, 2023. The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
410  0$aLecture Notes in Computer Science,$x1611-3349 ;$v14235
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   $a518.1
702   $aBournez$b Olivier
702   $aFormenti$b Enrico
702   $aPotapov$b Igor
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910746959803321
996   $aReachability Problems$93573647
997   $aUNINA