001440622 000__ 03855cam\a2200721\i\4500
001440622 001__ 1440622
001440622 003__ OCoLC
001440622 005__ 20230309004650.0
001440622 006__ m\\\\\o\\d\\\\\\\\
001440622 007__ cr\un\nnnunnun
001440622 008__ 211030s2021\\\\sz\a\\\\o\\\\\101\0\eng\d
001440622 019__ $$a1280599648$$a1281140522$$a1281971498$$a1287777073$$a1292517691
001440622 020__ $$a9783030897161$$q(electronic bk.)
001440622 020__ $$a3030897168$$q(electronic bk.)
001440622 020__ $$z9783030897154
001440622 020__ $$z303089715X
001440622 0247_ $$a10.1007/978-3-030-89716-1$$2doi
001440622 035__ $$aSP(OCoLC)1281240105
001440622 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dDCT$$dOCLCF$$dDKU$$dOCLCO$$dOCLCQ$$dOCLCO$$dOCLCQ
001440622 049__ $$aISEA
001440622 050_4 $$aQA76.76.V47$$bI58 2021
001440622 08204 $$a005.1/4$$223
001440622 1112_ $$aInternational Conference on Reachability Problems$$n(15th :$$d2021 :$$cLiverpool, England)
001440622 24510 $$aReachability problems :$$b15th international conference, RP 2021, Liverpool, UK, October 25-27, 2021 : proceedings /$$cPaul C. Bell, Patrick Totzke, Igor Potapov (eds.).
001440622 24630 $$aRP 2021
001440622 264_1 $$aCham :$$bSpringer,$$c[2021]
001440622 264_4 $$c©2021
001440622 300__ $$a1 online resource :$$billustrations (some color)
001440622 336__ $$atext$$btxt$$2rdacontent
001440622 337__ $$acomputer$$bc$$2rdamedia
001440622 338__ $$aonline resource$$bcr$$2rdacarrier
001440622 347__ $$atext file
001440622 347__ $$bPDF
001440622 4901_ $$aLecture notes in computer science ;$$v13035
001440622 4901_ $$aLNCS sublibrary: SL1 - Theoretical computer science and general issues
001440622 500__ $$aInternational conference proceedings.
001440622 500__ $$aIncludes author index.
001440622 5050_ $$aInvited Papers -- Quantitative vs. Weighted Automata -- Theorem Proving Using Clausal Resolution: From Past to Present -- Population Protocols: Beyond Runtime Analysis -- Recent Advances on Reachability Problems for Valence Systems (Invited Talk) -- Regular Papers -- Improvements in Unfolding of Colored Petri Nets -- Reachability of weakly nonlinear systems using Carleman linearization -- Continued Fraction approach to Gauss-Reduction theory -- Absent Subsequences in Words -- Minimal Number of Calls in Propositional Protocols -- Reachability Is NP-Complete Even for the Simplest Neural Networks.-
001440622 506__ $$aAccess limited to authorized users.
001440622 520__ $$aChapter Recent Advances on Reachability Problems for Valence Systems is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
001440622 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 4, 2021).
001440622 650_0 $$aComputer systems$$xVerification$$vCongresses.
001440622 650_0 $$aDecidability (Mathematical logic)$$vCongresses.
001440622 650_0 $$aComputer science$$xMathematics$$vCongresses.
001440622 650_6 $$aSystèmes informatiques$$xVérification$$vCongrès.
001440622 650_6 $$aDécidabilité (Logique mathématique)$$vCongrès.
001440622 650_6 $$aInformatique$$xMathématiques$$vCongrès.
001440622 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001440622 655_7 $$aConference papers and proceedings.$$2lcgft
001440622 655_7 $$aActes de congrès.$$2rvmgf
001440622 655_0 $$aElectronic books.
001440622 7001_ $$aBell, Paul C.,$$eeditor.
001440622 7001_ $$aTotzke, Patrick,$$eeditor.
001440622 7001_ $$aPotapov, Igor,$$eeditor.
001440622 77608 $$iPrint version:$$aInternational Conference on Reachability Problems (15th : 2021 : Liverpool, England).$$tReachability problems.$$dCham : Springer, [2021]$$z303089715X$$z9783030897154$$w(OCoLC)1269097939
001440622 830_0 $$aLecture notes in computer science ;$$v13035.
001440622 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001440622 852__ $$bebk
001440622 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-89716-1$$zOnline Access$$91397441.1
001440622 909CO $$ooai:library.usi.edu:1440622$$pGLOBAL_SET
001440622 980__ $$aBIB
001440622 980__ $$aEBOOK
001440622 982__ $$aEbook
001440622 983__ $$aOnline
001440622 994__ $$a92$$bISE