SIGMOD
2012
ACM
11 years 7 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
DLOG
2011
12 years 8 months ago
2011
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
FUIN
2010
13 years 1 months ago
2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T n...
ECCC
2010
13 years 1 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
RP
2010
Springer
13 years 2 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
SPIN
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
PVLDB
2010
13 years 2 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
JUCS
2010
13 years 3 months ago
2010
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...
SIAMCO
2002
13 years 4 months ago
2002
The paper studies the problem of reachability for linear systems in the presence of uncertain input disturbances that may also be interpreted as the action of an adversary in a ga...