000 03746nam a22005775i 4500
001 978-3-319-45994-3
003 DE-He213
005 20240423125205.0
007 cr nn 008mamaa
008 160912s2016 sz | s |||| 0|eng d
020 _a9783319459943
_9978-3-319-45994-3
024 7 _a10.1007/978-3-319-45994-3
_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] :
_b10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings /
_cedited by Kim Guldstrand Larsen, Igor Potapov, Jiří Srba.
250 _a1st ed. 2016.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2016.
300 _aXIV, 193 p. 38 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 ;
_v9899
505 0 _aThe Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.
520 _aThis book constitutes the refereed proceedings of the 10th International Workshop on Reachability Problems, RP 2016, held in Aalborg, Denmark, in September 2016. The 11 full papers presented together with2 invited papers and 3 abstracts of invited talks were carefully reviewed and selected from 18 submissions. The papers cover a range of topics in the field of reachability for infinite 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 _aMachine theory.
650 0 _aAlgorithms.
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aAlgorithms.
700 1 _aLarsen, Kim Guldstrand.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSrba, Jiří.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319459936
776 0 8 _iPrinted edition:
_z9783319459950
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v9899
856 4 0 _uhttps://doi.org/10.1007/978-3-319-45994-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c175243
_d175243