000 03446nam a22006375i 4500
001 978-3-642-41036-9
003 DE-He213
005 20200421111840.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 _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
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.
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 _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.
650 0 _aSoftware engineering.
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
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 _aAbdulla, Parosh Aziz.
_eeditor.
700 1 _aPotapov, Igor.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642410352
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8169
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-41036-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c55503
_d55503