Skip to main content
SpringerLink
Log in
Book cover

Reachability Problems

6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Alain Finkel

    1. LSV & ENS Cachan, Cachan Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jérôme Leroux

    1. Univ. Bordeaux, LaBRI, CNRS, Talence Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Igor Potapov

    1. Department of Computer Science, University of Liverpool,, Liverpool, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results

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

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

Included in the following conference series:

Conference proceedings info: RP 2012.

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 49.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 (12 papers)

  1. Front Matter

    Download chapter PDF

  2. Fraenkel-Mostowski Sets with Non-homogeneous Atoms

    • Mikołaj Bojańczyk, Sławomir Lasota
    Pages 1-5

  3. Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata

    • Sylvain Salvati, Igor Walukiewicz
    Pages 6-20

  4. Decision Problems for Linear Recurrence Sequences

    • Joël Ouaknine, James Worrell
    Pages 21-28

  5. Playing Games with Counter Automata

    • Antonín Kučera
    Pages 29-41

  6. LTL-Model-Checking via Model Composition

    • Ingo Felscher
    Pages 42-53

  7. On the Relationship between Reachability Problems in Timed and Counter Automata

    • Christoph Haase, Joël Ouaknine, James Worrell
    Pages 54-65

  8. Smooth Sand Piles

    • Stefano Brocchi, Paolo Massazza
    Pages 66-78

  9. Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis

    • Luca Benvenuti, Davide Bresolin, Pieter Collins, Alberto Ferrari, Luca Geretti, Tiziano Villa
    Pages 79-91

  10. Robustness of Time Petri Nets under Guard Enlargement

    • S. Akshay, Loïc Hélouët, Claude Jard, Pierre-Alain Reynier
    Pages 92-106

  11. Efficient Probabilistic Model Checking of Systems with Ranged Probabilities

    • Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić, Aarti Gupta
    Pages 107-120

  12. On the Length of Knot Transformations via Reidemeister Moves I and II

    • Rafiq Saleh
    Pages 121-136

  13. Invariants for LTI Systems with Uncertain Input

    • Paul Hänsch, Stefan Kowalewski
    Pages 137-148

  14. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Workshop on Reachability Problems, RP 2012, held in Bordeaux, France, in September, 2012. The 8 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 15 submissions. The papers present current research and original contributions related to reachability problems in different computational models and systems such as algebraic structures, computational models, hybrid systems, logic and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modeled as games.

Editors and Affiliations

  • LSV & ENS Cachan, Cachan Cedex, France

    Alain Finkel

  • Univ. Bordeaux, LaBRI, CNRS, Talence Cedex, France

    Jérôme Leroux

  • Department of Computer Science, University of Liverpool,, Liverpool, UK

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation