|
|
|
|
| LEADER |
03230nam a22005775i 4500 |
| 001 |
11137 |
| 003 |
DE-He213 |
| 005 |
20130725201552.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100821s2010 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642153495
|9 978-3-642-15349-5
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-15349-5
|2 doi
|
| 050 |
# |
4 |
|a QA76.9.L63
|
| 050 |
# |
4 |
|a QA76.5913
|
| 050 |
# |
4 |
|a QA76.63
|
| 072 |
# |
7 |
|a UM
|2 bicssc
|
| 072 |
# |
7 |
|a UYF
|2 bicssc
|
| 072 |
# |
7 |
|a COM051000
|2 bisacsh
|
| 072 |
# |
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 100 |
1 |
# |
|a Ku era, Antonn̕.
|e editor.
|
| 245 |
1 |
0 |
|a Reachability Problems
|b 4th International Workshop, RP 2010, Brno, Czech Republic, August 28-29, 2010. Proceedings /
|c edited by Antonn̕ Ku era, Igor Potapov.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
# |
# |
|a X, 199p. 42 illus.
|b online resource.
|
| 336 |
# |
# |
|a text
|b txt
|2 rdacontent
|
| 337 |
# |
# |
|a computer
|b c
|2 rdamedia
|
| 338 |
# |
# |
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
# |
# |
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
# |
|a Lecture Notes in Computer Science,
|v 6227
|x 0302-9743 ;
|
| 520 |
# |
# |
|a 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 |
|a Computer science.
|
| 650 |
# |
0 |
|a Software engineering.
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Logic design.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 700 |
1 |
# |
|a Potapov, Igor.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642153488
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 6227
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-15349-5
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|