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