Reachability problems : 4th international workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010 : proceedings / Antonin Kucera, Igor Potapov (eds.).
Contributor(s): Kučera, Antonín | Potapov, IgorMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 6227.; LNCS sublibrary: Publisher: Berlin : Springer, ©2010Description: 1 online resource (x, 197 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642153495; 3642153496; 9783642153488; 3642153488Subject(s): Computer systems -- Verification -- Congresses | Decidability (Mathematical logic) -- Congresses | Graph theory -- Data processing -- Congresses | Computer Systems -- standards | Logic | Models, Theoretical | Informatique | Computer systems -- Verification | Decidability (Mathematical logic) | Graph theory -- Data processingGenre/Form: Congress. | Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Reachability problems.DDC classification: 003 LOC classification: QA76.76.V47 | R6 2010Other classification: 53.89 Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and author index.
Annotation This book constitutes the research papers presented at the 4th International Workshop, RP 2010 held in Brno, Czech Republic, August 28-29, 2010 and was co-located with Joint MFCS and CSL 2010 (35th International Symposiums on Mathematical Foundations of Computer Science and 19th EACSL Annual Conferences on Computer Science Logic). The revised 9 full papers and the 4 invited talks of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures (semigroups, groups and rings), frontiers between decidable and undecidable reachability problems, predictability in iterative maps and new computational paradigms.
Print version record.
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.