Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Reachability

Known as: Graph reachability, Reach 
In graph theory, reachability refers to the ability to get from one vertex to another within a graph. A vertex can reach a vertex (and is reachable… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Hamilton-Jacobi (HJ) reachability analysis is an important formal verification method for guaranteeing performance and safety… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We consider concurrent two-player games with reachability objectives. In such games, at each round, player 1 and player 2… Expand
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a method for the computation of reachable sets of uncertain linear systems. The main innovation of the method consists… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The primary purpose of a network is to provide reachability between applications running on end hosts. In this paper, we describe… Expand
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Reachability and distance queries in graphs are fundamental to numerous applications, ranging from geographic navigation systems… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Complete geometric criteria are presented for controllability and reachability of switched linear systems 
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The problem of systematically synthesizing hybrid controllers which satisfy multiple control objectives is considered. We present… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract : This paper describes how a number of program-analysis problems can be solved by transforming them to graph… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?