000 04427nam a22006495i 4500
001 978-3-030-30806-3
003 DE-He213
005 20240730165741.0
007 cr nn 008mamaa
008 190905s2019 sz | s |||| 0|eng d
020 _a9783030308063
_9978-3-030-30806-3
024 7 _a10.1007/978-3-030-30806-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] :
_b13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings /
_cedited by Emmanuel Filiot, Raphaël Jungers, Igor Potapov.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXX, 233 p. 275 illus., 14 illus. in color.
_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 ;
_v11674
505 0 _aBidding Games on Markov Decision Processes -- Primitivity and synchronizing automata: a functional analytic approach -- Reaching Out Towards Fully Verified 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 Verification 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.
520 _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.
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 0 _aElectronic digital computers
_xEvaluation.
_921495
650 0 _aComputers.
_98172
650 0 _aProfessions.
_984435
650 0 _aComputer science
_xMathematics.
_93866
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aSystem Performance and Evaluation.
_932047
650 2 4 _aThe Computing Profession.
_984437
650 2 4 _aMathematics of Computing.
_931875
700 1 _aFiliot, Emmanuel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_990514
700 1 _aJungers, Raphaël.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_990515
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_990516
710 2 _aSpringerLink (Online service)
_990517
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030308056
776 0 8 _iPrinted edition:
_z9783030308070
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11674
_990518
856 4 0 _uhttps://doi.org/10.1007/978-3-030-30806-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86520
_d86520