Skip to main content
  • Conference proceedings
  • © 2011

Reachability Problems

5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings

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

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

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

Conference series link(s): RP: International Conference on Reachability Problems

Conference proceedings info: RP 2011.

Buy it now

Buying options

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.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

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

Table of contents (20 papers)

  1. Front Matter

  2. Graph Games with Reachability Objectives

    • Krishnendu Chatterjee
    Pages 1-1
  3. Observing Continuous-Time MDPs by 1-Clock Timed Automata

    • Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
    Pages 2-25
  4. Reachability Problems for Hybrid Automata

    • Jean-François Raskin
    Pages 28-30
  5. Synthesis of Timing Parameters Satisfying Safety Properties

    • Étienne André, Romain Soulat
    Pages 31-44
  6. Completeness of the Bounded Satisfiability Problem for Constraint LTL

    • Marcello M. Bersani, Achille Frigeri, Matteo Rossi, Pierluigi San Pietro
    Pages 58-71
  7. Characterizing Conclusive Approximations by Logical Formulae

    • Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat
    Pages 72-84
  8. Automated Termination in Model Checking Modulo Theories

    • Alessandro Carioni, Silvio Ghilardi, Silvio Ranise
    Pages 110-124
  9. Monotonic Abstraction for Programs with Multiply-Linked Structures

    • Parosh Aziz Abdulla, Jonathan Cederberg, Tomáš Vojnar
    Pages 125-138
  10. Efficient Bounded Reachability Computation for Rectangular Automata

    • Xin Chen, Erika Ábrahám, Goran Frehse
    Pages 139-152
  11. Reachability and Deadlocking Problems in Multi-stage Scheduling

    • Christian E. J. Eggermont, Gerhard J. Woeginger
    Pages 153-164
  12. Improving Reachability Analysis of Infinite State Systems by Specialization

    • Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni
    Pages 165-179
  13. A Fully Symbolic Bisimulation Algorithm

    • Malcolm Mumme, Gianfranco Ciardo
    Pages 218-230

Other Volumes

  1. Reachability Problems

About this book

This book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011. The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in 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 modelled as games.

Editors and Affiliations

  • Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, Genoa, Italy

    Giorgio Delzanno

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

    Igor Potapov

Bibliographic Information

Buy it now

Buying options

eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.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