Reachability Problems 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings

Başlık:

Yazar:

Larsen, Kim Guldstrand. editor.

ISBN:

9783319459943

Fiziksel Niteleme:

XIV, 193 p. 38 illus. online resource.

Seri:

Lecture Notes in Computer Science, 9899

İçindekiler:

The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.

Özet:

This book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 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.

Konu Başlığı:

Computation by Abstract Devices.

Logics and Meanings of Programs.

Mathematical Logic and Formal Languages.

Algorithm Analysis and Problem Complexity.

Yazar Ek Girişi:

Larsen, Kim Guldstrand.