000745357 000__ 02803cam\a2200529Mi\4500
000745357 001__ 745357
000745357 005__ 20230306141304.0
000745357 006__ m\\\\\o\\d\\\\\\\\
000745357 007__ cr\nn\nnnunnun
000745357 008__ 150930s2015\\\\sz\a\\\\od\\\\100\0\eng\d
000745357 020__ $$a9783319245379$$qelectronic book
000745357 020__ $$a3319245376$$qelectronic book
000745357 020__ $$z9783319245362
000745357 0247_ $$a10.1007/978-3-319-24537-9$$2doi
000745357 035__ $$aSP(OCoLC)ocn932169431
000745357 035__ $$aSP(OCoLC)932169431
000745357 040__ $$aNUI$$beng$$cNUI$$dOCLCO$$dORU$$dYDXCP$$dOCLCF$$dGW5XE
000745357 049__ $$aISEA
000745357 050_4 $$aQA76.76.V47
000745357 050_4 $$aQA75.5-76.95
000745357 08204 $$a004.0151$$223
000745357 1112_ $$aRP (Workshop)$$n(9th :$$d2015 :$$cWarsaw, Poland)
000745357 24510 $$aReachability problems$$h[electronic resource] :$$b9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings /$$cedited by Mikołaj Bojańczyk, Sławomir Lasota, Igor Potapov.
000745357 264_1 $$aCham :$$bSpringer,$$c2015.
000745357 300__ $$a1 online resource (xx, 179 pages) :$$billustrations.
000745357 336__ $$atext$$btxt$$2rdacontent
000745357 337__ $$acomputer$$bc$$2rdamedia
000745357 338__ $$aonline resource$$bcr$$2rdacarrier
000745357 347__ $$atext file$$bPDF$$2rda
000745357 4901_ $$aLecture Notes in Computer Science,$$x0302-9743 ;$$v9328
000745357 4901_ $$aLNCS sublibrary. SL 1, Theoretical computer science and general issues
000745357 506__ $$aAccess limited to authorized users.
000745357 520__ $$aThis book constitutes the refereed proceedings of the 9th International Workshop on Reachability Problems, RP 2015, held in Warsaw, Poland, in September 2015. The 14 papers presented together with 6 extended abstracts in this volume were carefully reviewed and selected from 23 submissions. The papers cover a range of topics in the field of 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.
000745357 650_0 $$aComputer science.
000745357 650_0 $$aComputers.
000745357 650_0 $$aComputer logic.
000745357 650_0 $$aLogic, Symbolic and mathematical.
000745357 7001_ $$aBojańczyk, Mikołaj,$$eeditor.
000745357 7001_ $$aLasota, Sławomir,$$eeditor.
000745357 7001_ $$aPotapov, Igor,$$eeditor.
000745357 77608 $$iPrint version:$$z9783319245362
000745357 830_0 $$aLecture notes in computer science ;$$v9328.
000745357 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000745357 85280 $$bebk$$hSpringerLink
000745357 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-24537-9$$zOnline Access$$91397441.1
000745357 909CO $$ooai:library.usi.edu:745357$$pGLOBAL_SET
000745357 980__ $$aEBOOK
000745357 980__ $$aBIB
000745357 982__ $$aEbook
000745357 983__ $$aOnline
000745357 994__ $$a92$$bISE