Reachability Problems 16th International Conference, RP 2022, Kaiserslautern, Germany, October 17-21, 2022, Proceedings / [electronic resource] :
edited by Anthony W. Lin, Georg Zetzsche, Igor Potapov.
- 1st ed. 2022.
- XLIII, 179 p. 28 illus., 7 illus. in color. online resource.
- Lecture Notes in Computer Science, 13608 1611-3349 ; .
- Lecture Notes in Computer Science, 13608 .
This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022. The 8 full papers presented were carefully reviewed and selected from 14 submissions. In addition, 3 invited papers were included in this volume. The RP proceedings 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.
9783031191350
10.1007/978-3-031-19135-0 doi
Machine theory.
Computer science.
Software engineering.
Logic programming.
Algorithms.
Computer science--Mathematics.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Software Engineering.
Logic in AI.
Design and Analysis of Algorithms.
Mathematics of Computing.
QA267-268.5
005.131
This book constitutes the refereed proceedings of the 15th International Conference on Reachability Problems, RP 2022, held in Kaiserslautern, Germany, in October 2022. The 8 full papers presented were carefully reviewed and selected from 14 submissions. In addition, 3 invited papers were included in this volume. The RP proceedings 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.
9783031191350
10.1007/978-3-031-19135-0 doi
Machine theory.
Computer science.
Software engineering.
Logic programming.
Algorithms.
Computer science--Mathematics.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
Software Engineering.
Logic in AI.
Design and Analysis of Algorithms.
Mathematics of Computing.
QA267-268.5
005.131