000 04408nam a22005895i 4500
001 978-3-642-04420-5
003 DE-He213
005 20240730183514.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642044205
_9978-3-642-04420-5
024 7 _a10.1007/978-3-642-04420-5
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aReachability Problems
_h[electronic resource] :
_bThird International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings /
_cedited by Olivier Bournez, Igor Potapov.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aX, 233 p.
_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 ;
_v5797
505 0 _aOn the Reachability Problem for Dynamic Networks of Concurrent Pushdown Systems -- Formalisms for Specifying Markovian Population Models -- Reachability for Continuous and Hybrid Systems -- Algorithmic Information Theory and Foundations of Probability -- Model Checking as A Reachability Problem -- Automatic Verification of Directory-Based Consistency Protocols -- On Yen's Path Logic for Petri Nets -- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates -- How to Tackle Integer Weighted Automata Positivity -- A Reduction Theorem for the Verification of Round-Based Distributed Algorithms -- Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems -- An Undecidable Permutation of the Natural Numbers -- Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order -- Counting Multiplicity over Infinite Alphabets -- The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane -- Games with Opacity Condition -- Abstract Counterexamples for Non-disjunctive Abstractions -- Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems -- Games on Higher Order Multi-stack Pushdown Systems -- Limit Set Reachability in Asynchronous Graph Dynamical Systems.
520 _aThis book constitutes the research papers presented at the 3rd International Workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms. .
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aComputer science.
_99832
650 0 _aComputer programming.
_94169
650 0 _aAlgorithms.
_93390
650 1 4 _aMathematics of Computing.
_931875
650 2 4 _aTheory of Computation.
_9132315
650 2 4 _aProgramming Techniques.
_9132316
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
700 1 _aBournez, Olivier.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9132317
700 1 _aPotapov, Igor.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9132318
710 2 _aSpringerLink (Online service)
_9132319
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642044199
776 0 8 _iPrinted edition:
_z9783642044212
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5797
_9132320
856 4 0 _uhttps://doi.org/10.1007/978-3-642-04420-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91905
_d91905