Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11674)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: RP 2019.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
The 14 full papers presented were carefully reviewed and selected from 26 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
Table of contents (17 papers)
Other volumes
-
Reachability Problems
Editors and Affiliations
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: 13th International Conference, RP 2019, Brussels, Belgium, September 11–13, 2019, Proceedings
Editors: Emmanuel Filiot, Raphaël Jungers, Igor Potapov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-30806-3
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-30805-6Published: 06 September 2019
eBook ISBN: 978-3-030-30806-3Published: 06 September 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XX, 233
Number of Illustrations: 261 b/w illustrations, 14 illustrations in colour
Topics: Logics and Meanings of Programs, Software Engineering, Artificial Intelligence, System Performance and Evaluation, The Computing Profession, Mathematics of Computing