↓ 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 Reasoning About Cost-Utility Constraints in Probabilistic Models
  3. Altmetric Badge
    Chapter 2 Integer-Complete Synthesis for Bounded Parametric Timed Automata
  4. Altmetric Badge
    Chapter 3 Polynomial Interrupt Timed Automata
  5. Altmetric Badge
    Chapter 4 Irregular Behaviours for Probabilistic Automata
  6. Altmetric Badge
    Chapter 5 Reachability in Succinct One-Counter Games
  7. Altmetric Badge
    Chapter 6 On Reachability-Related Games on Vector Addition Systems with States
  8. Altmetric Badge
    Chapter 7 A Topological Method for Finding Invariant Sets of Continuous Systems
  9. Altmetric Badge
    Chapter 8 The Ideal View on Rackoff’s Coverability Technique
  10. Altmetric Badge
    Chapter 9 Synthesis Problems for One-Counter Automata
  11. Altmetric Badge
    Chapter 10 On Boundedness Problems for Pushdown Vector Addition Systems
  12. Altmetric Badge
    Chapter 11 Multithreaded-Cartesian Abstract Interpretation of Multithreaded Recursive Programs Is Polynomial
  13. Altmetric Badge
    Chapter 12 Over-Approximating Terms Reachable by Context-Sensitive Rewriting
  14. Altmetric Badge
    Chapter 13 Reducing Bounded Realizability Analysis to Reachability Checking
  15. Altmetric Badge
    Chapter 14 Rearranging Two Dimensional Arrays by Prefix Reversals
  16. Altmetric Badge
    Chapter 15 The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
Attention for Chapter 2: Integer-Complete Synthesis for Bounded Parametric Timed Automata
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
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
Integer-Complete Synthesis for Bounded Parametric Timed Automata
Chapter number 2
Book title
Reachability Problems
Published by
Springer, Cham, September 2015
DOI 10.1007/978-3-319-24537-9_2
Book ISBNs
978-3-31-924536-2, 978-3-31-924537-9
Authors

Étienne André, Didier Lime, Olivier H. Roux

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Unknown 1 100%

This page is provided by Altmetric.