rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Reachability Problems
    sub title: 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings
  name:
    name part: Bournez, Olivier.
    role:
      role term: editor.
  name:
    name part: Potapov, Igor.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2009
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 233 p. online resource.
  abstract: This book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms. .
  table of contents: On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems -- Formalisms for Specifying Markovian Population Models -- Reachability for Continuous and Hybrid Systems -- Algorithmic Information Theory and Foundations of Probability -- Model Checking as A Reachability Problem -- Automatic Verification of Directory-Based Consistency Protocols -- On Yen’s Path Logic for Petri Nets -- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates -- How to Tackle Integer Weighted Automata Positivity -- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms -- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems -- An Undecidable Permutation of the Natural Numbers -- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order -- Counting Multiplicity over Infinite Alphabets -- The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane -- Games with Opacity Condition -- Abstract Counterexamples for Non-disjunctive Abstractions -- Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems -- Games on Higher Order Multi-stack Pushdown Systems -- Limit Set Reachability in Asynchronous Graph Dynamical Systems.
  note: edited by Olivier Bournez, Igor Potapov.
  subject:
    topic: Computer science
  subject:
    topic: Computer programming
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer logic
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Mathematics of Computing
  subject:
    topic: Theory of Computation
  subject:
    topic: Programming Techniques
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Computation by Abstract Devices
  classification: QA76.9.M35
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5797
  identifier: 9783642044205
  identifier: http://dx.doi.org/10.1007/978-3-642-04420-5
  record info:
    record creation date: 100301
    record change date: 20170118054952.0
    record identifier: 978-3-642-04420-5