# Reachability problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Inf. Process. Lett.
- 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

- CAV
- 2009

We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem inâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- HSCC
- 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

- Automatica
- 2004

Questions of reachability for continuous and hybrid systems can be formulated as optimal control or game theory problems, whoseâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- 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

- J. Symb. Comput.
- 2001

The control paradigm of physical processes being supervised by digital programs has lead to the development of a theory of hybridâ€¦Â (More)

Is this relevant?

2001

2001

- Fundam. Inform.
- 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)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- CONCUR
- 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

- HSCC
- 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

- POPL
- 1995

The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time byâ€¦Â (More)

Is this relevant?