Reachability Problems

17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings

AvOlivier Bournez,Enrico Formenti

Häftad, Engelska, 2023

Del 14235 i serien Lecture Notes in Computer Science

734 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2023-10-05
Mått:155 x 235 x 14 mm
Vikt:382 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:199
Upplaga:23001
Förlag:Springer International Publishing AG
ISBN:9783031452857

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Artificiell intelligens inom Data och IT

Innehållsförteckning

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.