Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014,

Reachability Problems

8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings

Ouaknine, Joel, Potapov, Igor, Worrell, James (Eds.)

2014, XX, 246 p. 59 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$49.99

(net) price for USA

ISBN 978-3-319-11439-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$72.00

(net) price for USA

ISBN 978-3-319-11438-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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

Content Level » Research

Keywords » Petri nets - automata theory - communicating automata - computational aspects of semigroups, groups, and rings - computational complexity - decidable and undecidable reachability problems - dynamical and hybrid systems - formal languages - formal methods - infinite state systems - prdictability in iterative maps - program analysis - reachability analysis - rewrite systems - rewriting systems - software system models - theory of computation - timed automata

Related subjects » Software Engineering - Theoretical Computer Science

Table of contents 

Complexity 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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Computation by Abstract Devices.