Reachability Problems 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings /
Reachability Problems 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings / [electronic resource] :
edited by Mikolai Bojanczyk, Slawomir Lasota, Igor Potapov.
- 1st ed. 2015.
- XX, 179 p. 33 illus. online resource.
- Theoretical Computer Science and General Issues, 9328 2512-2029 ; .
- Theoretical Computer Science and General Issues, 9328 .
This book constitutes the refereed proceedings of the 9th International Workshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 submissions. The papers cover a range of topics in the field of 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.
9783319245379
10.1007/978-3-319-24537-9 doi
Computer science.
Machine theory.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA75.5-76.95
004.0151
This book constitutes the refereed proceedings of the 9th International Workshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 submissions. The papers cover a range of topics in the field of 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.
9783319245379
10.1007/978-3-319-24537-9 doi
Computer science.
Machine theory.
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA75.5-76.95
004.0151