Reachability Problems : 17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings / / edited by Olivier Bournez, Enrico Formenti, Igor Potapov

• Pubblicazione: Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
• Edizione: 1st ed. 2023.
• Descrizione fisica: 1 online resource (231 pages)
• Disciplina: 518.1
• Soggetto topico: Machine theory; Computer science; Software engineering; Logic programming; Algorithms; Computer science - Mathematics; Formal Languages and Automata Theory; Computer Science Logic and Foundations of Programming; Software Engineering; Logic in AI; Design and Analysis of Algorithms; Mathematics of Computing
• Persona (resp. second.): BournezOlivier; FormentiEnrico; PotapovIgor
• Nota di bibliografia: Includes bibliographical references and index.
• Nota di contenuto: 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.
• Sommario/riassunto: 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.
• Titolo autorizzato: Reachability Problems
• ISBN: 3-031-45286-0
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 9910746959803321
• Lo trovi qui: Univ. Federico II
• Serie: Lecture Notes in Computer Science, . 1611-3349 ; ; 14235