Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14235)
Included in the following conference series:
Conference proceedings info: RP 2023.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
The 13 full papers included in this book were carefully reviewed and selected from 19 submissions. They present recent research on reachability problems to promote the exploration of new approaches for the modeling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
Keywords
- architecture verification and validation
- artificial intelligence
- automata theory
- computer programming
- computer systems
- distributed computer systems
- embedded systems
- formal languages
- formal logic
- graph theory
- model checking
- software architecture
- software design
- software engineering
- theoretical computer science
Table of contents (14 papers)
-
Invited Papers
-
Regular Papers
Other volumes
-
Reachability Problems
Editors and Affiliations
Bibliographic Information
Book Title: Reachability Problems
Book Subtitle: 17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings
Editors: Olivier Bournez, Enrico Formenti, Igor Potapov
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-031-45286-4
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2023
Softcover ISBN: 978-3-031-45285-7Published: 05 October 2023
eBook ISBN: 978-3-031-45286-4Published: 04 October 2023
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XLVIII, 199
Number of Illustrations: 19 b/w illustrations, 14 illustrations in colour
Topics: Mathematical Logic and Formal Languages, Logics and Meanings of Programs, Software Engineering/Programming and Operating Systems, Logic in AI, Algorithm Analysis and Problem Complexity, Mathematics of Computing