000 | 03613nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-642-41036-9 | ||
003 | DE-He213 | ||
005 | 20240730191826.0 | ||
007 | cr nn 008mamaa | ||
008 | 130903s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642410369 _9978-3-642-41036-9 |
||
024 | 7 |
_a10.1007/978-3-642-41036-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aReachability Problems _h[electronic resource] : _b7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013, Proceedings / _cedited by Parosh Aziz Abdulla, Igor Potapov. |
250 | _a1st ed. 2013. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXII, 223 p. 60 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v8169 |
|
505 | 0 | _aReachability for finite state systems -- Rewriting systems, reachability analysis in counter/timed/cellular/communicating automata -- Petri-nets -- Computational aspects of semigroups, groups and rings -- Reachability in dynamical and hybrid systems -- Frontiers between decidable and undecidable reachability problems -- Complexity and decidability aspects, predictability in iterative maps and new computational paradigms. | |
520 | _aThis book constitutes the refereed proceedings of the 7th International Workshop on Reachability Problems, RP 2013, held in Uppsala, Sweden, in September 2013. The 19 revised papers (The 14 revised papers were carefully reviewed and selected from 24 submissions in addition to 5 invited talks) were carefully reviewed and selected from 24 submissions. Topics of interest include reachability for finite state systems; rewriting systems, reachability analysis in counter/timed/cellular/communicating automata; Petri-nets; computational aspects of semigroups, groups and rings; reachability in dynamical and hybrid systems; frontiers between decidable and undecidable reachability problems; complexity and decidability aspects, predictability in iterative maps and new computational paradigms. | ||
650 | 0 |
_aComputer science. _99832 |
|
650 | 0 |
_aSoftware engineering. _94138 |
|
650 | 0 |
_aMachine theory. _9147457 |
|
650 | 0 |
_aCompilers (Computer programs). _93350 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 1 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
650 | 2 | 4 |
_aSoftware Engineering. _94138 |
650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9147458 |
650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
650 | 2 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aTheory of Computation. _9147459 |
700 | 1 |
_aAbdulla, Parosh Aziz. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9147460 |
|
700 | 1 |
_aPotapov, Igor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9147461 |
|
710 | 2 |
_aSpringerLink (Online service) _9147462 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642410352 |
776 | 0 | 8 |
_iPrinted edition: _z9783642410376 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v8169 _9147463 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-41036-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c93923 _d93923 |