Central Library

Normal view MARC view ISBD view

Reachability Problems [electronic resource] : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings / edited by Kim Guldstrand Larsen, Igor Potapov, Jiří Srba.

Contributor(s): Larsen, Kim Guldstrand [editor.] | Potapov, Igor [editor.] | Srba, Jiří [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 9899Publisher: Cham : Springer International Publishing : Imprint: Springer, 2016Edition: 1st ed. 2016.Description: XIV, 193 p. 38 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319459943.Subject(s): Computer science | Machine theory | Algorithms | Theory of Computation | Computer Science Logic and Foundations of Programming | Formal Languages and Automata Theory | AlgorithmsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
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.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

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.

There are no comments for this item.

Log in to your account to post a comment.