Reachability Problems (Record no. 112626)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04184nam a22005895i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-642-15349-5 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | DE-He213 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20140220084545.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100821s2010 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9783642153495 |
| -- | 978-3-642-15349-5 |
| 024 7# - OTHER STANDARD IDENTIFIER | |
| Standard number or code | 10.1007/978-3-642-15349-5 |
| Source of number or code | doi |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.9.L63 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.5913 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA76.63 |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UM |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | UYF |
| Source | bicssc |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM051000 |
| Source | bisacsh |
| 072 #7 - SUBJECT CATEGORY CODE | |
| Subject category code | COM036000 |
| Source | bisacsh |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1015113 |
| Edition number | 23 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Kučera, Antonín. |
| Relator term | editor. |
| 245 10 - TITLE STATEMENT | |
| Title | Reachability Problems |
| Medium | [electronic resource] : |
| Remainder of title | 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings / |
| Statement of responsibility, etc | edited by Antonín Kučera, Igor Potapov. |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg, |
| -- | 2010. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | X, 199p. 42 illus. |
| Other physical details | online resource. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| International Standard Serial Number | 0302-9743 ; |
| Volume number/sequential designation | 6227 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Software engineering. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer software. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Logic design. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Software Engineering. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Mathematical Logic and Formal Languages. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Programming Languages, Compilers, Interpreters. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computation by Abstract Devices. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Potapov, Igor. |
| Relator term | editor. |
| 710 2# - ADDED ENTRY--CORPORATE NAME | |
| Corporate name or jurisdiction name as entry element | SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY | |
| Title | Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Printed edition: |
| International Standard Book Number | 9783642153488 |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Lecture Notes in Computer Science, |
| -- | 0302-9743 ; |
| Volume number/sequential designation | 6227 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-642-15349-5 |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.