000			03886nam a22006015i 4500
001			978-3-319-11439-2
003			DE-He213
005			20200421112051.0
007			cr nn 008mamaa
008			140915s2014 gw | s |||| 0|eng d
020			_a9783319114392 _9978-3-319-11439-2
024	7		_a10.1007/978-3-319-11439-2 _2doi
050		4	_aQA75.5-76.95
072		7	_aUYZG _2bicssc
072		7	_aCOM037000 _2bisacsh
082	0	4	_a004.0151 _223
245	1	0	_aReachability Problems _h[electronic resource] : _b8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings / _cedited by Jo�el Ouaknine, Igor Potapov, James Worrell.
264		1	_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014.
300			_aXX, 246 p. 59 illus. _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, _x0302-9743 ; _v8762
505	0		_aComplexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets.
520			_aThis book constitutes the proceedings of the 8th International Workshop on Reachability Problems, RP 2014, held in Oxford, UK, in September 2014. The 17 papers presented in this volume were carefully reviewed and selected from 25 submissions. The book also contains a paper summarizing the invited talk. The papers offer new approaches for the modelling and analysis of computational processes by combining mathematical, algorithmic, and computational techniques.
650		0	_aComputer science.
650		0	_aSoftware engineering.
650		0	_aProgramming languages (Electronic computers).
650		0	_aCoding theory.
650		0	_aComputers.
650		0	_aComputer logic.
650		0	_aMathematical logic.
650	1	4	_aComputer Science.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aSoftware Engineering.
650	2	4	_aProgramming Languages, Compilers, Interpreters.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aCoding and Information Theory.
700	1		_aOuaknine, Jo�el. _eeditor.
700	1		_aPotapov, Igor. _eeditor.
700	1		_aWorrell, James. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783319114385
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v8762
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-319-11439-2
912			_aZDB-2-SCS
912			_aZDB-2-LNC
942			_cEBK
999			_c57186 _d57186