000			04271nam a22006615i 4500
001			978-3-319-67089-8
003			DE-He213
005			20210118153137.0
007			cr nn 008mamaa
008			170824s2017 gw | s |||| 0|eng d
020			_a9783319670898 _9978-3-319-67089-8
024	7		_a10.1007/978-3-319-67089-8 _2doi
050		4	_aQA75.5-76.95
072		7	_aUY _2bicssc
072		7	_aCOM037000 _2bisacsh
072		7	_aUY _2thema
082	0	4	_a004.0151 _223
245	1	0	_aReachability Problems _h[electronic resource] : _b11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / _cedited by Matthew Hague, Igor Potapov.
250			_a1st ed. 2017.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2017.
300			_aXV, 193 p. 34 illus. _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 ; _v10506
520			_aThis book constitutes the refereed proceedings of the 11th International Workshop on Reachability Problems, RP 2017, held in London, UK, in September 2017. The 12 full papers presented together with 1 invited paper were carefully reviewed and selected from 17 submissions. The aim of the conference is to bring together scholars from diverse fields with a shared interest in reachability problems, and to promote the exploration of new approaches for the modelling and analysis of computational processes by combining  mathematical, algorithmic, and computational techniques. Topics of interest include (but are not limited to): reachability for innite 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	_aComputers.
650		0	_aComputer logic.
650		0	_aMathematical logic.
650		0	_aAlgorithms.
650		0	_aSoftware engineering.
650		0	_aArtificial intelligence.
650	1	4	_aComputation by Abstract Devices. _0http://scigraph.springernature.com/things/product-market-codes/I16013
650	2	4	_aLogics and Meanings of Programs. _0http://scigraph.springernature.com/things/product-market-codes/I1603X
650	2	4	_aMathematical Logic and Formal Languages. _0http://scigraph.springernature.com/things/product-market-codes/I16048
650	2	4	_aAlgorithm Analysis and Problem Complexity. _0http://scigraph.springernature.com/things/product-market-codes/I16021
650	2	4	_aSoftware Engineering/Programming and Operating Systems. _0http://scigraph.springernature.com/things/product-market-codes/I14002
650	2	4	_aArtificial Intelligence. _0http://scigraph.springernature.com/things/product-market-codes/I21000
700	1		_aHague, Matthew. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aPotapov, Igor. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783319670881
776	0	8	_iPrinted edition: _z9783319670904
830		0	_aTheoretical Computer Science and General Issues ; _v10506
856	4	0	_uhttps://doi.org/10.1007/978-3-319-67089-8
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c453369 _d453369
942			_cEB
506			_aAvailable to subscribing member institutions only. Доступно лише організаціям членам підписки.
506			_fOnline access from local network of NaUOA.
506			_fOnline access with authorization at https://link.springer.com/
506			_fОнлайн-доступ з локальної мережі НаУОА.
506			_fОнлайн доступ з авторизацією на https://link.springer.com/