Advertisement

Reachability Problems

3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings

  • Olivier Bournez
  • Igor Potapov

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

Table of contents

  1. Front Matter
  2. Thomas A. Henzinger, Barbara Jobstmann, Verena Wolf
    Pages 3-23
  3. Moshe Y. Vardi
    Pages 35-35
  4. Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
    Pages 36-50
  5. Mohamed Faouzi Atig, Peter Habermehl
    Pages 51-63
  6. Roberto Barbuti, Francesca Levi, Paolo Milazzo, Guido Scatena
    Pages 64-78
  7. Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
    Pages 79-92
  8. Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz
    Pages 93-106
  9. Pieter Collins, Ivan S. Zapreev
    Pages 107-119
  10. Amaldev Manuel, R. Ramanujam
    Pages 141-153
  11. Bastien Maubert, Sophie Pinchinat
    Pages 166-175
  12. Kenneth L. McMillan, Lenore D. Zuck
    Pages 176-188
  13. V. S. Anil Kumar, Matt Macauley, Henning S. Mortveit
    Pages 217-232
  14. Back Matter

About these proceedings

Introduction

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.

 

Keywords

Permutation algebraic structures algorithms automata calculus computational models hyprid systems infinite state systems information theory logic petri nets reachability problems rewriting systems verification

Editors and affiliations

  • Olivier Bournez
    • 1
  • Igor Potapov
    • 2
  1. 1.Ecole Polytechnique, Laboratoire d’ Informatique (LIX)Palaiseau CedexFrance
  2. 2.Department of Computer Science, Ashton BuildingUniversity of LiverpoolLiverpoolEngland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-04420-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-04419-9
  • Online ISBN 978-3-642-04420-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site