10% off all books and free delivery over £50
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Reachability Problems Theoretical Computer Science and General Issues

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Reachability Problems Theoretical Computer Science and General Issues Synopsis

This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018.


The 11 full papers presented were carefully reviewed and selected from 21 submissions. The papers cover topics such as reachability for infinite state systems; rewriting systems; reachability analysis in counter/timed/cellular/communicating automata; Petri nets; computational aspects of semigroups, groups, and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects; predictability in iterative maps, and new computational paradigms.

About This Edition

ISBN: 9783030002497
Publication date:
Author: Igor Potapov, PierreAlain Reynier
Publisher: Springer an imprint of Springer International Publishing
Format: Paperback
Pagination: 161 pages
Series: Lecture Notes in Computer Science
Genres: Mathematical theory of computation
Maths for computer scientists
Numerical analysis
Probability and statistics