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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Kučera, Antonín (Επιμελητής έκδοσης), Potapov, Igor (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6227
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Programming Techniques.; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Software Engineering.; Mathematical Logic and Formal Languages.

Πίνακας περιεχομένων:

• 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.