Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 10506)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: RP 2017.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
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.
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.
Similar content being viewed by others
Keywords
- semantics
- software engineering
- model checking
- automata theory
- timed automata
- translation (languages)
- programming languages
- computer software selection and evaluation
- verification
- Reachability problems in infinite state systems
- rewriting systems
- dynamical and hybrid systems
- Petri-Nets
- reachability problems in logic and verification
- algorithm analysis and problem complexity
Table of contents (13 papers)
-
Front Matter
-
Back Matter
Other volumes
-
Reachability Problems
Editors and Affiliations
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: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-67089-8
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Softcover ISBN: 978-3-319-67088-1Published: 25 August 2017
eBook ISBN: 978-3-319-67089-8Published: 28 August 2017
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XV, 193
Number of Illustrations: 34 b/w illustrations
Topics: Computation by Abstract Devices, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Algorithm Analysis and Problem Complexity, Software Engineering/Programming and Operating Systems, Artificial Intelligence