Reachability

Known as: Graph reachability 
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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2017
020040060019692017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper introduces the model of linearly priced timed automata as an extension of timed automata, with prices on both… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this report we present an implementation of a symbolic reachability analyzer, FIXIT, based on SAT-methods. The problem of… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The paper describes the behavior of tight external ellipsoidal approximations of the reach sets and tubes for linear control… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
An open system can be modeled as a two-player game between the system and its environment. At each round of the game, player 1… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systems… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 5.2
Is this relevant?
Highly Cited
1971
Highly Cited
1971
  • D. P. BER EKAS, I. B. RHODESt
  • 1971
This paper is concerned with the clo d-loop control of discrete-time systems in the presence of uncertainty. The uncertainty may… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?