Reachability Problems 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings /
Reachability Problems 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings / [electronic resource] :
edited by Igor Potapov, Pierre-Alain Reynier.
- 1st ed. 2018.
- XXI, 161 p. 32 illus. online resource.
- Theoretical Computer Science and General Issues, 11123 2512-2029 ; .
- Theoretical Computer Science and General Issues, 11123 .
This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018. 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.
9783030002503
10.1007/978-3-030-00250-3 doi
Computer science.
Numerical analysis.
Computer science--Mathematics.
Mathematical statistics.
Computer Science Logic and Foundations of Programming.
Numerical Analysis.
Mathematical Applications in Computer Science.
Probability and Statistics in Computer Science.
QA75.5-76.95
004.0151
This book constitutes the refereed proceedings of the 12th International Conference on Reachability Problems, RP 2018, held in Marseille, France, in September 2018. 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.
9783030002503
10.1007/978-3-030-00250-3 doi
Computer science.
Numerical analysis.
Computer science--Mathematics.
Mathematical statistics.
Computer Science Logic and Foundations of Programming.
Numerical Analysis.
Mathematical Applications in Computer Science.
Probability and Statistics in Computer Science.
QA75.5-76.95
004.0151