Skip to main content
SpringerLink
Log in

Reachability Problems

4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Antonín Kučera

    1. Faculty of Informatics, Masaryk University, Brno, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Igor Potapov

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Unique visibility, state-of-the-art survey,
  • fast-track conference proceedings

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

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

Included in the following conference series:

Conference proceedings info: RP 2010.

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 (13 papers)

  1. Front Matter

    Download chapter PDF

  2. Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata

    • Markus Holzer, Martin Kutrib
    Pages 1-23

  3. Symbolic and Compositional Reachability for Timed Automata

    • Kim Guldstrand Larsen
    Pages 24-28

  4. Temporal Logics over Linear Time Domains Are in PSPACE

    • Alexander Rabinovich
    Pages 29-50

  5. Lossy Counter Machines Decidability Cheat Sheet

    • Philippe Schnoebelen
    Pages 51-75

  6. Behavioral Cartography of Timed Automata

    • Étienne André, Laurent Fribourg
    Pages 76-90

  7. On the Joint Spectral Radius for Bounded Matrix Languages

    • Paul C. Bell, Vesa Halava, Mika Hirvensalo
    Pages 91-103

  8. Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P

    • Jakub Chaloupka
    Pages 104-119

  9. Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata

    • Maurice Margenstern
    Pages 120-132

  10. Rewriting Systems for Reachability in Vector Addition Systems with Pairs

    • Paulin Jacobé de Naurois, Virgile Mogbil
    Pages 133-145

  11. The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions

    • Martin Mundhenk, Felix Weiß
    Pages 146-160

  12. Depth Boundedness in Multiset Rewriting Systems with Name Binding

    • Fernando Rosa-Velardo
    Pages 161-175

  13. Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA

    • Zdeněk Sawa
    Pages 176-182

  14. Efficient Graph Reachability Query Answering Using Tree Decomposition

    • Fang Wei
    Pages 183-197

  15. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Reachability Problems

Keywords

Editors and Affiliations

  • Faculty of Informatics, Masaryk University, Brno, Czech Republic

    Antonín Kučera

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

    Igor Potapov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation