1 option
Reachability Problems : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings / edited by Kim Guldstrand Larsen, Igor Potapov, Jiří Srba.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9899
- Theoretical Computer Science and General Issues, 2512-2029 ; 9899
- Language:
- English
- Subjects (All):
- Computer science.
- Machine theory.
- Algorithms.
- Theory of Computation.
- Computer Science Logic and Foundations of Programming.
- Formal Languages and Automata Theory.
- Local Subjects:
- Theory of Computation.
- Computer Science Logic and Foundations of Programming.
- Formal Languages and Automata Theory.
- Algorithms.
- Physical Description:
- 1 online resource (XIV, 193 pages) : 38 illustrations
- Edition:
- 1st ed. 2016.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-45994-3
- 9783319459943
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.