000 | 00968 a2200265 4500 | ||
---|---|---|---|
001 | 374495 | ||
003 | OSt | ||
005 | 20240829120913.0 | ||
008 | 230424b |||||||| |||| 00| 0 eng d | ||
020 | _a978-3-319-24537-9 | ||
040 | _cIITB | ||
041 | _aeng | ||
245 | _aReachability problems : 9th international workshop, RP, proceedings, Warsaw, Poland, Sep. 21-23, 2015 (e-book) | ||
260 |
_aBerlin _bSpringer _c2015 |
||
440 |
_922935 _aLecture Notes in Computer Science (LNCS) _vv.9328 |
||
650 |
_aComputer Science and Engineering _97673 |
||
650 | 0 |
_aComputer systems _xVerification _vCongresses _947074 |
|
650 | 0 |
_a Decidability (Mathematical logic) _xCongresses _947075 |
|
650 | 0 |
_aComputer science _xMathematics _vCongresses _96770 |
|
700 |
_aBojanczyk, Mikolai _eEditor _947076 |
||
700 |
_aLasota, Slawomir _eEditor _947077 |
||
700 |
_aPotapov, Igor _eEditor _932281 |
||
856 | _uhttps://doi.org/10.1007/978-3-319-24537-9 | ||
942 |
_cEB _2udc |
||
999 |
_c184604 _d184604 |