000914628 000__ 05114cam\a2200565Ii\4500
000914628 001__ 914628
000914628 005__ 20230306150402.0
000914628 006__ m\\\\\o\\d\\\\\\\\
000914628 007__ cr\cn\nnnunnun
000914628 008__ 190920s2019\\\\sz\a\\\\ob\\\\101\0\eng\d
000914628 019__ $$a1122165663
000914628 020__ $$a9783030308063$$q(electronic book)
000914628 020__ $$a3030308065$$q(electronic book)
000914628 020__ $$z9783030308056
000914628 0247_ $$a10.1007/978-3-030-30806-3$$2doi
000914628 035__ $$aSP(OCoLC)on1120103343
000914628 035__ $$aSP(OCoLC)1120103343$$z(OCoLC)1122165663
000914628 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dUKMGB$$dOCLCF$$dEBLCP
000914628 049__ $$aISEA
000914628 050_4 $$aQA76.76.V47
000914628 08204 $$a005.14$$223
000914628 1112_ $$aRP (Workshop)$$n(13th :$$d2019 :$$cBrussels, Belgium)
000914628 24510 $$aReachability problems :$$b13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, proceedings /$$cEmmanuel Filiot, Raphaël Jungers, Igor Potapov (eds.).
000914628 264_1 $$aCham, Switzerland :$$bSpringer,$$c[2019]
000914628 300__ $$a1 online resource (xx, 233 pages) :$$billustrations.
000914628 336__ $$atext$$btxt$$2rdacontent
000914628 337__ $$acomputer$$bc$$2rdamedia
000914628 338__ $$aonline resource$$bcr$$2rdacarrier
000914628 4901_ $$aLecture notes in computer science ;$$v11674
000914628 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000914628 504__ $$aIncludes bibliographical references and index.
000914628 5050_ $$aIntro; Preface; Organization; Abstracts of Invited Talks; Bidding Games on Markov Decision Processes; The Reachability Problem for Petri Nets is Not Elementary; Primitivity and Synchronizing Automata: A Functional Analytic Approach; Game Graphs for Reactive Synthesis; Reaching Out Towards Fully Verified Autonomous Systems; Contents; Bidding Games on Markov Decision Processes; 1 Introduction; 2 Preliminaries; 3 Qualitative Bidding Games on MDPs; 4 Mean-Payoff Bidding Games on Strongly-Connected MDPs; 5 Discussion; References
000914628 5058_ $$aPrimitivity and Synchronizing Automata: A Functional Analytic Approach1 Introduction; 2 Contraction Operators and Reachability Theorems; 3 Contractive Families and Functional Equations; 4 m-primitivity and m-syncronising Automata; References; Reaching Out Towards Fully Verified Autonomous Systems; 1 Introduction; 2 Preliminaries: Neural Networks; 2.1 Neural Networks; 3 Verification of Neural Networks; 3.1 Abstract Interpretation for Neural Networks; 3.2 Training with Robustness; 3.3 Closed Loop Verification; 3.4 Falsification and Testing; 4 Challenges; 5 Conclusion; References
000914628 5058_ $$aOn the m-eternal Domination Number of Cactus Graphs1 Introduction; 2 The m-eternal Domination of Christmas Cactus Graphs; 3 Upper Bound on the m-eternal Domination Number of Cactus Graphs; 4 Linear-Time Algorithm; 5 Future Work; References; On Relevant Equilibria in Reachability Games; 1 Introduction; 2 Preliminaries and Studied Problems; 3 Existence Problems; 4 Solving Decision Problems; 4.1 -Consistent Play; 4.2 Characterizations; 4.3 Sufficiency of Lassoes; 4.4 Algorithms; 4.5 Results; References; Partial Solvers for Generalized Parity Games; 1 Introduction; 2 Preliminaries
000914628 5058_ $$a3 Zielonka's Algorithm with Partial Solvers4 Algorithms BüchiSolver and GenBüchiSolver; 5 Algorithms GoodEpSolver and GenGoodEpSolver; 6 Algorithms LaySolver and GenLaySolver; 7 Empirical Evaluation; References; Reachability in Augmented Interval Markov Chains; 1 Introduction; 2 Preliminaries; 3 Qualitative Case; 4 Quantitative Case: Upper Bound; 5 Quantitative Case: Lower Bound; 6 Approximate Case; References; On Solving Word Equations Using SAT; 1 Introduction; 2 Preliminaries; 3 Word Equation Solving; 3.1 Solving Bounded Word Equation; 3.2 Refining Bounds and Guiding the Search
000914628 5058_ $$a4 Experiments5 Conclusion; References; Parameterised Verification of Publish/Subscribe Networks with Exception Handling; 1 Introduction; 2 Formal Model of Pub/Sub Architectures; 2.1 Pub/Sub Networks; 3 Example: Specification of an IoT System; 4 The Coverability Decision Problem; 4.1 Decision Procedure for Coverability in Pub/Sub Networks; 5 Notification with Retained Messages; 6 Handling Exceptions During Notifications; 7 Conclusions; References; Cellular Automata for the Self-stabilisation of Colourings and Tilings; 1 Introduction; 2 Setting of the Problem; 3 The Case of 2-Colourings
000914628 506__ $$aAccess limited to authorized users.
000914628 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed September 20, 2019).
000914628 650_0 $$aComputer systems$$xVerification$$vCongresses.
000914628 650_0 $$aDecidability (Mathematical logic)$$vCongresses.
000914628 650_0 $$aComputer science$$xMathematics$$vCongresses.
000914628 7001_ $$aFiliot, Emmanuel,$$eeditor.
000914628 7001_ $$aJungers, Raphaël,$$eeditor.
000914628 7001_ $$aPotapov, Igor,$$eeditor.
000914628 830_0 $$aLecture notes in computer science ;$$v11674.
000914628 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000914628 852__ $$bebk
000914628 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-30806-3$$zOnline Access$$91397441.1
000914628 909CO $$ooai:library.usi.edu:914628$$pGLOBAL_SET
000914628 980__ $$aEBOOK
000914628 980__ $$aBIB
000914628 982__ $$aEbook
000914628 983__ $$aOnline
000914628 994__ $$a92$$bISE