Reachability Problems

SOMMARIO

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.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9783642153488
• Collana: Lecture Notes in Computer Science
• Dimensioni: 0 x 0 mm Ø 329 gr
• Formato: Brossura
• Illustration Notes: X, 199 p. 42 illus.
• Pagine Arabe: 199
• Pagine Romane: x