000 | 02712nam a22005295i 4500 | ||
---|---|---|---|
001 | u376770 | ||
003 | SIRSI | ||
005 | 20160812084429.0 | ||
007 | cr nn 008mamaa | ||
008 | 110924s2011 gw | s |||| 0|eng d | ||
020 |
_a9783642242885 _9978-3-642-24288-5 |
||
040 | _cMX-MeUAM | ||
050 | 4 | _aQA76.9.L63 | |
050 | 4 | _aQA76.5913 | |
050 | 4 | _aQA76.63 | |
082 | 0 | 4 |
_a005.1015113 _223 |
100 | 1 |
_aDelzanno, Giorgio. _eeditor. |
|
245 | 1 | 0 |
_aReachability Problems _h[recurso electrónico] : _b5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / _cedited by Giorgio Delzanno, Igor Potapov. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
300 |
_aXII, 245 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6945 |
|
520 | _aThis book constitutes the refereed proceedings of the 5th International Workshop on Reachability Problems, RP 2011, held in Genoa, Italy, in September 2011. The 16 papers presented together with 4 invited talks were carefully reviewed and selected from 24 submissions. The workshop deals with reachability problems that appear in algebraic structures, computational models, hybrid systems, logic, and verification. Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models like cellular automata and Petri nets, decision procedures for classical, modal and temporal logic, program analysis, discrete and continuous systems, time critical systems, and open systems modelled as games. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aLogic design. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
700 | 1 |
_aPotapov, Igor. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642242878 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6945 |
|
856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-24288-5 |
596 | _a19 | ||
942 | _cLIBRO_ELEC | ||
999 |
_c204650 _d204650 |