Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11123)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: RP 2018.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
- automata theory
- differential equations
- dynamical and hybrid systems
- eigenvalues and eigenfunctions
- eigenvectors
- finite automata
- integer programming
- knapsack problems
- matrix algebra
- numerical methods
- problem solving
- query processing
- rewriting systems
- search engines
- security analysis
- transition probabilities
Table of contents (11 papers)
Other volumes
-
Reachability Problems
Editors and Affiliations
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: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-00250-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2018
Softcover ISBN: 978-3-030-00249-7Published: 30 August 2018
eBook ISBN: 978-3-030-00250-3Published: 13 September 2018
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XXI, 161
Number of Illustrations: 32 b/w illustrations
Topics: Logics and Meanings of Programs, Numeric Computing, Math Applications in Computer Science, Probability and Statistics in Computer Science