276views Database» more  SIGMOD 2012»
11 years 5 months ago
SCARAB: scaling reachability computation on large graphs
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...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
12 years 6 months ago
Bidirectional Reachability-Based Modules
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...
Riku Nortje, Arina Britz, Thomas Andreas Meyer
141views more  FUIN 2010»
12 years 12 months ago
Decidability Problems in Petri Nets with Names and Replication
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...
Fernando Rosa Velardo, David de Frutos-Escrig
143views more  ECCC 2010»
12 years 12 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
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 ...
Derrick Stolee, N. V. Vinodchandran
150views Control Systems» more  RP 2010»
13 years 13 days ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
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...
Paulin Jacobé de Naurois, Virgile Mogbil
13 years 16 days ago
Place-Boundedness for Vector Addition Systems with one zero-test
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...
Rémi Bonnet, Alain Finkel, Jérô...
13 years 28 days ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
149views more  PVLDB 2010»
13 years 29 days ago
GRAIL: Scalable Reachability Index for Large Graphs
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 ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
118views more  JUCS 2010»
13 years 1 months ago
Reachability in Restricted Walk on Integers
: 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...
Philip Ginzboorg, Valtteri Niemi
124views more  SIAMCO 2002»
13 years 2 months ago
On Reachability Under Uncertainty
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...
Alexander B. Kurzhanski, Pravin Varaiya