↓ Skip to main content
What is this page? Embed badge

Reachability Problems

Overview of attention for book
Cover of 'Reachability Problems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Reachability Analysis of Nonlinear ODEs Using Polytopic Based Validated Runge-Kutta
  3. Altmetric Badge
    Chapter 2 The Satisfiability of Word Equations: Decidable and Undecidable Theories
  4. Altmetric Badge
    Chapter 3 Left-Eigenvectors Are Certificates of the Orbit Problem
  5. Altmetric Badge
    Chapter 4 Constrained Dynamic Tree Networks
  6. Altmetric Badge
    Chapter 5 EXPSPACE-Complete Variant of Countdown Games, and Simulation on Succinct One-Counter Nets
  7. Altmetric Badge
    Chapter 6 Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification
  8. Altmetric Badge
    Chapter 7 Knapsack in Hyperbolic Groups
  9. Altmetric Badge
    Chapter 8 Generalized Tag Systems
  10. Altmetric Badge
    Chapter 9 Certain Query Answering on Compressed String Patterns: From Streams to Hyperstreams
  11. Altmetric Badge
    Chapter 10 Büchi VASS Recognise $$\mathbf {\Sigma }^{1}_{1}$$ -complete $${\omega }$$ -languages
  12. Altmetric Badge
    Chapter 11 Qualitative Reachability for Open Interval Markov Chains
Attention for Chapter 4: Constrained Dynamic Tree Networks
Altmetric Badge

Readers on

mendeley
1 Mendeley
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Constrained Dynamic Tree Networks
Chapter number 4
Book title
Reachability Problems
Published by
Springer, Cham, September 2018
DOI 10.1007/978-3-030-00250-3_4
Book ISBNs
978-3-03-000249-7, 978-3-03-000250-3
Authors

Matthew Hague, Vincent Penelle, Hague, Matthew, Penelle, Vincent

View on publisher site

This page is provided by Altmetric.