Reachability Problems [electronic resource] : 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings / edited by Igor Potapov, Pierre-Alain Reynier.
Contributor(s): Potapov, Igor [editor.]
| Reynier, Pierre-Alain [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 11123Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: XXI, 161 p. 32 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783030002503.Subject(s): 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 ScienceAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.