000 03487nam a22006015i 4500
001 vtls000485361
003 RU-ToGU
005 20210922070051.0
007 cr nn 008mamaa
008 140715s2013 gw | s |||| 0|eng d
020 _a9783642410369
_9978-3-642-41036-9
024 7 _a10.1007/978-3-642-41036-9
_2doi
035 _ato000485361
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aAbdulla, Parosh Aziz.
_eeditor.
_9416107
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.
260 _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
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_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.
_9155490
650 0 _aSoftware engineering.
_9566225
650 0 _aComputer software.
_9303280
650 0 _aLogic design.
_9306256
650 1 4 _aComputer Science.
_9155490
650 2 4 _aLogics and Meanings of Programs.
_9306257
650 2 4 _aSoftware Engineering.
_9566285
650 2 4 _aMathematical Logic and Formal Languages.
_9303363
650 2 4 _aProgramming Languages, Compilers, Interpreters.
_9303287
650 2 4 _aAlgorithm Analysis and Problem Complexity.
_9303732
650 2 4 _aComputation by Abstract Devices.
_9305111
700 1 _aPotapov, Igor.
_eeditor.
_9416108
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aLecture Notes in Computer Science,
_9279505
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-41036-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c357682