Reachability Problems

11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings
1. Auflage 2017
ISBN: 978-3-319-67088-1
Verlag: Springer International Publishing

Buch, Englisch, 193 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 3285 g

Reihe: Theoretical Computer Science and General Issues

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.

Zielgruppe

Research

Autoren/Hrsg.

Potapov, Igor

Hague, Matthew

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Reachability problems in infinite state systems.- rewriting systems.- dynamical and hybrid systems.- reachability problems in logic and verification.- eachability analysis in different computational models.-  Petri-Nets.- Computational aspects of algebraic structures.