Reachability Problems: Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings

Author:   Olivier Bournez ,  Igor Potapov
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Edition:   2009 ed.
Volume:   5797
ISBN:  

9783642044199


Pages:   233
Publication Date:   07 September 2009
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $190.08 Quantity:  
Add to Cart

Share |

Reachability Problems: Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings


Add your own review!

Overview

Full Product Details

Author:   Olivier Bournez ,  Igor Potapov
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2009 ed.
Volume:   5797
Dimensions:   Width: 15.50cm , Height: 1.30cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9783642044199


ISBN 10:   3642044190
Pages:   233
Publication Date:   07 September 2009
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List