000 04234nam a22006375i 4500
001 978-3-031-72621-7
003 DE-He213
005 20250516160141.0
007 cr nn 008mamaa
008 240919s2024 sz | s |||| 0|eng d
020 _a9783031726217
_9978-3-031-72621-7
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aReachability Problems
_h[electronic resource] :
_b18th International Conference, RP 2024, Vienna, Austria, September 25-27, 2024, Proceedings /
_cedited by Laura Kovács, Ana Sokolova.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXXVI, 239 p. 31 illus., 15 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 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v15050
505 0 _aInvited Papers -- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach.-The Satis ability and Validity Problems for Probabilistic CTL.-Computability and Reachability -- Computing Reachable Simulations on Transition Systems -- Computing All Minimal Ways to Reach a Context-Free Language -- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness -- Automata and Complexity -- Rollercoasters with Plateaus -- Quantum Automata and Languages of Finite Index -- On Shortest Products for Nonnegative Matrix Mortality -- Hardness of Busy Beaver Value BB(15) -- Linear Systems and Recurrences -- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps -- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability.-Reachability in Linear Recurrence Automata -- Games and Abstractions -- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems -- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives -- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.
520 _aThis book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25-27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.
541 _fUABC ;
_cPerpetuidad
650 0 _aMachine theory.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aLogic programming.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aLogic in AI.
650 2 4 _aDesign and Analysis of Algorithms.
650 2 4 _aMathematics of Computing.
700 1 _aKovács, Laura.
_eeditor.
_0(orcid)0000-0002-8299-2714
_1https://orcid.org/0000-0002-8299-2714
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSokolova, Ana.
_eeditor.
_0(orcid)0000-0002-8384-3438
_1https://orcid.org/0000-0002-8384-3438
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031726200
776 0 8 _iPrinted edition:
_z9783031726224
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v15050
856 4 0 _zLibro electrónico
_uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-72621-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c276473
_d276472