Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2017

Highly Cited

2017

In this paper, a compact representation of the reachability graph of a Petri net is proposed. The transition set of a Petri net… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for… Expand

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… Expand

Is this relevant?

Highly Cited

2001

Highly Cited

2001

This paper uses dynamic programming techniques to describe reach sets andrelated problems of forward and backward reachability… Expand

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… Expand

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 coefficients and… Expand

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… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

The reachability set for vector addition systems of dimension less than or equal to five are shown to be effectively computable… Expand

Is this relevant?

Highly Cited

1975