Reachability Problems

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

Kim Guldstrand Larsen, Igor Potapov, Jiří Srba (Herausgeber)

Buch | Softcover

XIV, 193 Seiten

2016 | 1st ed. 2016
Springer International Publishing (Verlag)
978-3-319-45993-6 (ISBN)

Artikel merken

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.

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.

Erscheinungsdatum	08.10.2016
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XIV, 193 p. 38 illus.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Themenwelt	Informatik ► Software Entwicklung ► User Interfaces (HCI)
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
Schlagworte	Algorithm analysis and problem complexity • Applications • Automata Theory • Complex Systems • computation by abstract devices • Computer Science • conference proceedings • Decidability • Dynamical Systems • groups • Hybrid Systems • infinite alphabet • Informatics • insertion-deletion • languages reachability • Petri Nets • Probabilistic Systems • reachability games • relational words • Research • Rewriting Systems • Theory of Computation • timed automata • User interface design and usability • vector addition game • winning strategy • word problems
ISBN-10	3-319-45993-7 / 3319459937
ISBN-13	978-3-319-45993-6 / 9783319459936
Zustand	Neuware