000 04174nam a22006375i 4500
001 978-3-319-11439-2
003 DE-He213
005 20240423125928.0
007 cr nn 008mamaa
008 140915s2014 sz | 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 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
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 Joel Ouaknine, Igor Potapov, James Worrell.
250 _a1st ed. 2014.
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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 _aCompilers (Computer programs).
650 0 _aMachine theory.
650 0 _aCoding theory.
650 0 _aInformation theory.
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aSoftware Engineering.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCoding and Information Theory.
700 1 _aOuaknine, Joel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWorrell, James.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319114385
776 0 8 _iPrinted edition:
_z9783319114408
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8762
856 4 0 _uhttps://doi.org/10.1007/978-3-319-11439-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183200
_d183200