Read While You Wait - Get immediate ebook access, if available*, when you order a print book

Theoretical Computer Science and General Issues

Reachability Problems

12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings

Editors: Potapov, Igor, Reynier, Pierre-Alain (Eds.)

Free Preview

Buy this book

eBook $44.99
price for USA in USD
  • ISBN 978-3-030-00250-3
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $59.99
price for USA in USD
  • ISBN 978-3-030-00249-7
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (11 chapters)

Table of contents (11 chapters)
  • Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta

    Pages 1-14

    Alexandre dit Sandretto, Julien (et al.)

  • The Satisfiability of Word Equations: Decidable and Undecidable Theories

    Pages 15-29

    Day, Joel D. (et al.)

  • Left-Eigenvectors Are Certificates of the Orbit Problem

    Pages 30-44

    Oliveira, Steven (et al.)

  • Constrained Dynamic Tree Networks

    Pages 45-58

    Hague, Matthew (et al.)

  • EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets

    Pages 59-74

    Jančar, Petr (et al.)

Buy this book

eBook $44.99
price for USA in USD
  • ISBN 978-3-030-00250-3
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $59.99
price for USA in USD
  • ISBN 978-3-030-00249-7
  • Free shipping for individuals worldwide
  • Immediate ebook access, if available*, with your print order
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Reachability Problems
Book Subtitle
12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings
Editors
  • Igor Potapov
  • Pierre-Alain Reynier
Series Title
Theoretical Computer Science and General Issues
Series Volume
11123
Copyright
2018
Publisher
Springer International Publishing
Copyright Holder
Springer Nature Switzerland AG
eBook ISBN
978-3-030-00250-3
DOI
10.1007/978-3-030-00250-3
Softcover ISBN
978-3-030-00249-7
Edition Number
1
Number of Pages
XXI, 161
Number of Illustrations
32 b/w illustrations
Topics

*immediately available upon purchase as print book shipments may be delayed due to the COVID-19 crisis. ebook access is temporary and does not include ownership of the ebook. Only valid for books with an ebook version. Springer Reference Works are not included.