LEADER 04603nam 22007815 450 001 9910349282703321 005 20251225193617.0 010 $a3-030-30806-5 024 7 $a10.1007/978-3-030-30806-3 035 $a(CKB)4100000009191139 035 $a(DE-He213)978-3-030-30806-3 035 $a(MiAaPQ)EBC5924422 035 $a(PPN)255547315 035 $a(EXLCZ)994100000009191139 100 $a20190905d2019 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aReachability Problems $e13th International Conference, RP 2019, Brussels, Belgium, September 11?13, 2019, Proceedings /$fedited by Emmanuel Filiot, Raphaël Jungers, Igor Potapov 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XX, 233 p. 275 illus., 14 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11674 311 08$a3-030-30805-7 320 $aIncludes bibliographical references and index. 327 $aBidding Games on Markov Decision Processes -- Primitivity and synchronizing automata: a functional analytic approach -- Reaching Out Towards Fully Veri?ed Autonomous Systems -- On the m-eternal Domination Number of Cactus Graphs -- On Relevant Equilibria in Reachability Games -- Partial Solvers for Generalized Parity Games -- Reachability in Augmented Interval Markov Chains -- On Solving Word Equations Using SAT -- Parameterised Veri?cation of Publish/Subscribe Networks with Exception Handling -- Cellular automata for the self-stabilisation of colourings and tilings -- On the termination problem for counter machines with incrementing errors -- Reachability Problems on Partially Lossy Queue Automata -- On the computation of the minimal coverability set of Petri nets -- Deciding Reachability for Piecewise Constant Derivative Systems on Orientable Manifolds -- Coverability is undecidable in one-dimensional pushdown vector addition systems with resets -- Synthesisof structurally restricted b-bounded Petri nets: complexity results -- Reachability of Five Gossip Protocols. 330 $aThis book constitutes the refereed proceedings of the 13th International Conference on Reachability Problems, RP 2019, held in Brussels, Belgium, in September 2019. The 14 full papers presented were carefully reviewed and selected from 26 submissions. The papers cover topics such as 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11674 606 $aComputer science 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aElectronic digital computers$xEvaluation 606 $aComputers 606 $aProfessions 606 $aComputer science$xMathematics 606 $aComputer Science Logic and Foundations of Programming 606 $aSoftware Engineering 606 $aArtificial Intelligence 606 $aSystem Performance and Evaluation 606 $aThe Computing Profession 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 0$aElectronic digital computers$xEvaluation. 615 0$aComputers. 615 0$aProfessions. 615 0$aComputer science$xMathematics. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aSoftware Engineering. 615 24$aArtificial Intelligence. 615 24$aSystem Performance and Evaluation. 615 24$aThe Computing Profession. 615 24$aMathematics of Computing. 676 $a004.0151 676 $a005.14 702 $aFiliot$b Emmanuel$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aJungers$b Raphaël$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPotapov$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910349282703321 996 $aReachability Problems$93573647 997 $aUNINA