↓ 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 SAT-Based Invariant Inference and Its Relation to Concept Learning
  3. Altmetric Badge
    Chapter 2 Post’s Correspondence Problem: From Computer Science to Algebra
  4. Altmetric Badge
    Chapter 3 The Past and Future of Embedded Finite Model Theory
  5. Altmetric Badge
    Chapter 4 Linearization, Model Reduction and Reachability in Nonlinear ode s
  6. Altmetric Badge
    Chapter 5 History-Deterministic Timed Automata Are Not Determinizable
  7. Altmetric Badge
    Chapter 6 Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata
  8. Altmetric Badge
    Chapter 7 The Stochastic Arrival Problem
  9. Altmetric Badge
    Chapter 8 On Higher-Order Reachability Games Vs May Reachability
  10. Altmetric Badge
    Chapter 9 Coefficient Synthesis for Threshold Automata
  11. Altmetric Badge
    Chapter 10 Subsequences in Bounded Ranges: Matching and Analysis Problems
  12. Altmetric Badge
    Chapter 11 Canonization of Reconfigurable PT Nets in  Maude
Attention for Chapter 5: History-Deterministic Timed Automata Are Not Determinizable
Altmetric Badge
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
History-Deterministic Timed Automata Are Not Determinizable
Chapter number 5
Book title
Reachability Problems
Published by
Springer, Cham, January 2022
DOI 10.1007/978-3-031-19135-0_5
Book ISBNs
978-3-03-119134-3, 978-3-03-119135-0
Authors

Bose, Sougata, Henzinger, Thomas A., Lehtinen, Karoliina, Schewe, Sven, Totzke, Patrick

View on publisher site
Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

This page is provided by Altmetric.