Reachability Problems 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings /

This 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 verificatio...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bournez, Olivier (Επιμελητής έκδοσης), Potapov, Igor (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
Σειρά:Lecture Notes in Computer Science, 5797
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04201nam a22005895i 4500
001 978-3-642-04420-5
003 DE-He213
005 20170118054952.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642044205  |9 978-3-642-04420-5 
024 7 |a 10.1007/978-3-642-04420-5  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.M35 
072 7 |a UYA  |2 bicssc 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a MAT003000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Reachability Problems  |h [electronic resource] :  |b 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings /  |c edited by Olivier Bournez, Igor Potapov. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2009. 
300 |a X, 233 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5797 
505 0 |a On 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 |a This 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 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Mathematics of Computing. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Computation by Abstract Devices. 
700 1 |a Bournez, Olivier.  |e editor. 
700 1 |a Potapov, Igor.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642044199 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5797 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-04420-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)