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

Gespeichert in:

Personen und Körperschaften:	Kučera, Antonin (VerfasserIn), Potapov, Igor (Sonstige)
Titel:	Reachability Problems: 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings/ edited by Antonín Kučera, Igor Potapov
Format:	E-Book Konferenzbericht
Sprache:	Englisch
veröffentlicht:	Berlin, Heidelberg Springer Berlin Heidelberg 2010
Gesamtaufnahme:	SpringerLink Lecture notes in computer science ; 6227
Schlagwörter:	Computer software Logic design Computer Science Computer science Software engineering Compilers (Computer programs). Computer programming. Machine theory. Konferenzschrift > 2010 > Brünn
Buchausg. u.d.T.:	Reachability problems, Berlin : Springer, 2010, X, 197 S.
Quelle:	Verbunddaten SWB
Zugangsinformationen:	Elektronischer Volltext - Campuslizenz

Details
Zusammenfassung:	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.
Umfang:	Online-Ressource (X, 199p. 42 illus, digital)
ISBN:	9783642153495
DOI:	10.1007/978-3-642-15349-5