Title Reachability problems : 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings / edited by Mikołaj Bojańczyk, Sławomir Lasota, Igor Potapov

Published Cham : Springer, 2015

Click on the following:
Springer Computer Science eBooks
Springer eBooks

Copies

Description 1 online resource (xx, 179 pages) : color illustrations Series Lecture Notes in Computer Science, 0302-9743 ; 9328 LNCS sublibrary. SL 1, Theoretical computer science and general issues Lecture notes in computer science ; 9328. 0302-9743 LNCS sublibrary. SL 1, Theoretical computer science and general issues. Contents Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Modeling and Co-design of Control Tasks OverWireless Networking Protocols: Stateof the Art and Challenges -- Vector Addition Systems Howto -- Recent Results on ConcurrentReachability Games -- Horn Constraints with Quantifiersand Cardinalities -- Reachability Problems for Continuous LinearDynamical Systems -- Reasoning About Cost-Utility Constraintsin Probabilistic Models -- Contents -- Reasoning About Cost-Utility Constraints in Probabilistic Models -- References Integer-Complete Synthesis for Bounded Parametric Timed Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Clocks, Parameters and Constraints -- 2.2 Parametric Timed Automata -- 3 Parametric Extrapolation -- 4 Integer-Complete Dense Parametric Algorithms -- 4.1 Parametric Reachability: RIEF -- 4.2 Parametric Unavoidability: RIAF -- 4.3 Implementation in Romo -- 5 Conclusion -- References -- Polynomial Interrupt Timed Automata -- 1 Introduction -- 2 Polynomial ITA -- 3 Cylindrical Decomposition and Reachability -- 3.1 Definition -- 3.2 Reachability for PolITA 4 Effective Construction and on-the-fly Algorithm -- 4.1 Construction of a Cylindrical Decomposition -- 4.2 On-the-fly Algorithm -- 5 Conclusion and Discussion -- References -- Irregular Behaviours for Probabilistic Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Universally Non-regular Probabilistic Automaton -- 4 Main Result -- References -- Reachability in Succinct One-Counter Games -- 1 Introduction -- 2 Preliminaries -- 2.1 Arenas, Plays, and Strategies -- 2.2 One-Counter Systems -- 2.3 Winning Conditions -- 3 Equivalence of Models and Problems -- 3.1 Removing the Guards 3.2 Removing Negative Counter Values -- 3.3 From Reachability to Counter Reachability -- 4 EXPSPACE-completeness of Succinct One-Counter Games -- 4.1 Upper Bound -- 4.2 Lower Bounds -- 5 Conclusion and Further Work -- References -- On Reachability-Related Games on Vector Addition Systems with States -- 1 Introduction -- 1.1 Strategies, Winning Strategies, Winning Regions Win, Win -- 2 Reducing GIC-parity-eVASS to GIC-eVASS -- 3 A Direct Proof of Theorem 1 -- 3.1 Mixing -Strategies, and Pruning -Transitions -- 3.2 Detecting Nonnegative Cycles, and Their (Exponential) Lengths 3.3 Attractor-Based Algorithm for the GIC-parity-eVASS Problem -- References -- A Topological Method for Finding Invariant Sets of Continuous Systems -- 1 Introduction -- 2 Some Basics of Dynamical Systems Theory -- 3 Isolating Blocks: Algebraic Conditions -- 4 A Simple Combinatorial Condition for Proving the Existence of (Non-empty) Invariant Sets -- 5 Experiments -- 6 Conclusion and Future Work -- References -- The Ideal View on Rackoff's Coverability Technique -- 1 Introduction -- 2 Preliminaries -- 2.1 Well-Structured Transition Systems -- 2.2 Ideal Decompositions -- 3 Backward Coverability Summary 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 Notes English Subject Computer science. Computers. Computer logic. Logic, Symbolic and mathematical. Electronic Data Processing Computers computers. Computer logic Computer science Computers Logic, Symbolic and mathematical Genre/Form dictionaries. proceedings (reports) Dictionaries Conference papers and proceedings Dictionaries. Conference papers and proceedings. Dictionnaires. Actes de congrès. Form Electronic book Author Bojańczyk, Mikołaj, editor Lasota, Sławomir, editor Potapov, Igor, editor ISBN 9783319245379 3319245376

  Permalink