Reachability Problems [electronic resource] : 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings /
RP 2010Corporate Author
RP 2010(2010 :Brno, Czech Republic)
RP 2010
Kucera, Antonin.editor.
Potapov, Igor.editor.
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and index.
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.
Computer programming.
Software engineering.
Programming languages (Electronic computers).
Computer logic.
Mathematical logic.
Programming Techniques.
Software Engineering/Programming and Operating Systems.
Programming Languages, Compilers, Interpreters.
Logics and Meanings of Programs.
Software Engineering.
Mathematical Logic and Formal Languages.

Lecture Notes in Computer Science