TY - BOOK AU - Bournez,Olivier AU - Formenti,Enrico AU - Potapov,Igor TI - Reachability Problems: 17th International Conference, RP 2023, Nice, France, October 11-13, 2023, Proceedings T2 - Lecture Notes in Computer Science, SN - 9783031452864 U1 - 005.131 23 PY - 2023/// CY - Cham PB - Springer Nature Switzerland, Imprint: Springer KW - Machine theory KW - Computer science KW - Software engineering KW - Logic programming KW - Algorithms KW - Mathematics KW - Formal Languages and Automata Theory KW - Computer Science Logic and Foundations of Programming KW - Software Engineering KW - Logic in AI KW - Design and Analysis of Algorithms KW - Mathematics of Computing N1 - Invited 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 N2 - This 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 UR - https://doi.org/10.1007/978-3-031-45286-4 ER -