Reachability problem

Reachability is a fundamental problem that appears in several different contexts: finite- and infinite-state concurrent systems, computational models… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Branching vector addition systems are an extension of vector addition systems where new reachable vectors may be obtained by… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem in… (More)
  • figure 1
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper we generalize a model for stochastic hybrid systems. First, we prove that this model is a right Markov process and… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Questions of reachability for continuous and hybrid systems can be formulated as optimal control or game theory problems, whose… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper uses dynamic programming techniques to describe reach sets and related problems of forward and backward reachability… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The control paradigm of physical processes being supervised by digital programs has lead to the development of a theory of hybrid… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2001
2001
We study four solutions to the reachability problem for 1-sa fe Petri nets, all of them based on the unfolding technique. We… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study the veri cation of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This report describes the calculation of the reach sets and tubes for linear control systems with time-varying coeecients and… (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?