Buch, Englisch, 248 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 423 g
19th International Conference, RP 2025, Madrid, Spain, October 1-3, 2025, Proceedings
Buch, Englisch, 248 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 423 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-032-09523-7
Verlag: Springer
This book constitutes the proceedings of the 19th International Conference on Reachability Problems, RP 2025, which took place in Madrid, Spain, during October 1-3, 2025.
The 12 full papers included in these proceedings were carefully reviewed and selected from 35 submissions. The book also contains three invited talks in full paper length. The papers cover topics in reachability problems that appear, among others, in algebraic structures, automata theory and formal languages, computational game theory, concurrency and distributed computation, decision procedures in computational models, hybrid dynamical systems, logic and model checking, and verification of finite- and infinite-state systems.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Invited Papers.- When You Have a Fuzzer, Everything Looks Like a Reachability Problem.-The Role of Logic and Automata in Understanding Transformers.-Simplicity Lies in the Eye of the Beholder: A Strategic Perspective on Controllers in Reactive Synthesis. Regular Papers.- Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems.-Word Chain Generators for Prefix Normal Words.-Reachability and Mortality for Two-Dimensional RHPCD Systems Are co-NP-hard.-Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems.-Weighing Obese Timed Languages.-Box-Reachability in Vector Addition Systems.-Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS.-Nets-within-Nets through the Lens of Data Nets.-Compositional Verification of Almost-Sure Büchi Objectives in MDPs.-DTMC Model Checking by Path Abstraction Revisited.-Counterexample-Guided Abstraction Refinement for Star-Based Neural Network Verification.-Maximum Path Sets in trees.
