ONLY $9.90 DELIVERY INFO

Close Notification

Your cart does not contain any items

Reachability Problems

18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings...

Laura Kovács Ana Sokolova

$147.95   $118.08

Paperback

Not in-store but you can order this
How long will it take?

QTY:

English
Springer International Publishing AG
20 September 2024
This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25–27, 2024.

The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.
Edited by:   ,
Imprint:   Springer International Publishing AG
Country of Publication:   Switzerland
Edition:   2024 ed.
Volume:   15050
Dimensions:   Height: 235mm,  Width: 155mm, 
ISBN:   9783031726200
ISBN 10:   3031726200
Series:   Lecture Notes in Computer Science
Pages:   239
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active
Invited Papers.- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach.-The Satis ability and Validity Problems for Probabilistic CTL.-Computability and Reachability.- Computing Reachable Simulations on Transition Systems.- Computing All Minimal Ways to Reach a Context-Free Language.- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness.- Automata and Complexity.- Rollercoasters with Plateaus.- Quantum Automata and Languages of Finite Index.- On Shortest Products for Nonnegative Matrix Mortality.- Hardness of Busy Beaver Value BB(15).- Linear Systems and Recurrences.- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps.- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability.-Reachability in Linear Recurrence Automata.- Games and Abstractions.- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems.- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives.- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.

See Also