Loading…

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

Bibliographic Details
Call Number:Libro Electrónico
Corporate Author: SpringerLink (Online service)
Other Authors: Kucera, Antonin (Editor), Potapov, Igor (Editor)
Format: Electronic eBook
Language:Inglés
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010.
Edition:1st ed. 2010.
Series:Theoretical Computer Science and General Issues, 6227
Subjects:
Online Access:Texto Completo
Table of Contents:
  • Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata
  • Symbolic and Compositional Reachability for Timed Automata
  • Temporal Logics over Linear Time Domains Are in PSPACE
  • Lossy Counter Machines Decidability Cheat Sheet
  • Behavioral Cartography of Timed Automata
  • On the Joint Spectral Radius for Bounded Matrix Languages
  • Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P
  • Towards the Frontier between Decidability and Undecidability for Hyperbolic Cellular Automata
  • Rewriting Systems for Reachability in Vector Addition Systems with Pairs
  • The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
  • Depth Boundedness in Multiset Rewriting Systems with Name Binding
  • Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA
  • Efficient Graph Reachability Query Answering Using Tree Decomposition.