Theoretical Computer Science and General Issues

Reachability Problems

11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings

Editors: Hague, Matthew, Potapov, Igor (Eds.)

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-3-319-67089-8
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $72.00
price for USA
  • ISBN 978-3-319-67088-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions.
The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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 (13 chapters)

  • The Multiple Dimensions of Mean-Payoff Games

    Doyen, Laurent

    Pages 1-8

  • Adding Dense-Timed Stack to Integer Reset Timed Automata

    Bhave, Devendra (et al.)

    Pages 9-25

  • Space-Efficient Fragments of Higher-Order Fixpoint Logic

    Bruse, Florian (et al.)

    Pages 26-41

  • Refinement of Trace Abstraction for Real-Time Programs

    Cassez, Franck (et al.)

    Pages 42-58

  • An Abstract Machine for Asynchronous Programs with Closures and Priority Queues

    Ancona, Davide (et al.)

    Pages 59-74

Buy this book

eBook $54.99
price for USA (gross)
  • ISBN 978-3-319-67089-8
  • Digitally watermarked, DRM-free
  • Included format: PDF, EPUB
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $72.00
price for USA
  • ISBN 978-3-319-67088-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Reachability Problems
Book Subtitle
11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings
Editors
  • Matthew Hague
  • Igor Potapov
Series Title
Theoretical Computer Science and General Issues
Series Volume
10506
Copyright
2017
Publisher
Springer International Publishing
Copyright Holder
Springer International Publishing AG
eBook ISBN
978-3-319-67089-8
DOI
10.1007/978-3-319-67089-8
Softcover ISBN
978-3-319-67088-1
Edition Number
1
Number of Pages
XV, 193
Number of Illustrations and Tables
34 b/w illustrations
Topics