Reachability Problems electronic resource 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings / edited by Mikołaj Bojańczyk, Sławomir Lasota, Igor Potapov.
Material type:
TextSeries: Lecture Notes in Computer SciencePublication details: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015Description: XX, 179 p. 33 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319245379Subject(s): Computer Science | computers | Computer logic | Mathematical logic | Computer Science | Computation by Abstract Devices | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
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.
There are no comments on this title.