Reachability Problems 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings /
Reachability Problems 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / [electronic resource] :
edited by Antonin Kucera, Igor Potapov.
- 1st ed. 2010.
- X, 199 p. 42 illus. online resource.
- Theoretical Computer Science and General Issues, 6227 2512-2029 ; .
- Theoretical Computer Science and General Issues, 6227 .
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.
9783642153495
10.1007/978-3-642-15349-5 doi
Computer programming.
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Programming Techniques.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA76.6-76.66
005.11
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.
9783642153495
10.1007/978-3-642-15349-5 doi
Computer programming.
Software engineering.
Compilers (Computer programs).
Computer science.
Machine theory.
Programming Techniques.
Software Engineering.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
QA76.6-76.66
005.11