Skip to main content
SpringerLink
Log in
Book cover

Reachability Problems

Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Olivier Bournez

    1. Ecole Polytechnique, Laboratoire d’ Informatique (LIX), Palaiseau Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Potapov

    1. Department of Computer Science, Ashton Building, University of Liverpool, Liverpool, England

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5797)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: RP 2009.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (20 papers)

  1. Front Matter

    Download chapter PDF

  2. On the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems

    • Mohamed Faouzi Atig, Ahmed Bouajjani
    Pages 1-2

  3. Formalisms for Specifying Markovian Population Models

    • Thomas A. Henzinger, Barbara Jobstmann, Verena Wolf
    Pages 3-23

  4. Reachability for Continuous and Hybrid Systems

    • Oded Maler
    Pages 24-25

  5. Algorithmic Information Theory and Foundations of Probability

    • Alexander Shen
    Pages 26-34

  6. Model Checking as A Reachability Problem

    • Moshe Y. Vardi
    Pages 35-35

  7. Automatic Verification of Directory-Based Consistency Protocols

    • Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
    Pages 36-50

  8. On Yen’s Path Logic for Petri Nets

    • Mohamed Faouzi Atig, Peter Habermehl
    Pages 51-63

  9. Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates

    • Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena
    Pages 64-78

  10. How to Tackle Integer Weighted Automata Positivity

    • Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
    Pages 79-92

  11. A Reduction Theorem for the Verification of Round-Based Distributed Algorithms

    • Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz
    Pages 93-106

  12. Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems

    • Pieter Collins, Ivan S. Zapreev
    Pages 107-119

  13. An Undecidable Permutation of the Natural Numbers

    • Eero Lehtonen
    Pages 120-126

  14. Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

    • Denis Lugiez
    Pages 127-140

  15. Counting Multiplicity over Infinite Alphabets

    • Amaldev Manuel, R. Ramanujam
    Pages 141-153

  16. The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane

    • Maurice Margenstern
    Pages 154-165

  17. Games with Opacity Condition

    • Bastien Maubert, Sophie Pinchinat
    Pages 166-175

  18. Abstract Counterexamples for Non-disjunctive Abstractions

    • Kenneth L. McMillan, Lenore D. Zuck
    Pages 176-188

  19. Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems

    • Mila Majster-Cederbaum, Christoph Minnameier
    Pages 189-202

  20. Games on Higher Order Multi-stack Pushdown Systems

    • Anil Seth
    Pages 203-216
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

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.

Editors and Affiliations

  • Ecole Polytechnique, Laboratoire d’ Informatique (LIX), Palaiseau Cedex, France

    Olivier Bournez

  • Department of Computer Science, Ashton Building, University of Liverpool, Liverpool, England

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation