
JOSTLE
 Referenced in 33 articles
[sw04985]
 mesh as an undirected graph and then using stateoftheart graph partitioning techniques...

Graphplan
 Referenced in 181 articles
[sw07746]
 compact structure we call a planning graph. We describe a new planner, Graphplan, that uses ... shortest possible partialorder plan, or states that no valid plan exists.par We provide empirical...

VIATRA2
 Referenced in 33 articles
[sw03511]
 manipulating graph models by combining graph transformation and abstract state machines into a single specification ... offers advanced constructs for querying (e.g. recursive graph patterns) and manipulating models (e.g. generic transformation...

STAN
 Referenced in 38 articles
[sw03348]
 costs once the plangraph structure reaches a stable state. STAN has also always exploited...

CAESAR
 Referenced in 8 articles
[sw29138]
 also called labelled transition system, reachability graph, state space, etc.) corresponding to the behaviour ... perform explicitstate and onthefly verification on the generated graph, including model checking...

CLPSB
 Referenced in 7 articles
[sw00132]
 reduces the number of states in a reachability graph. We illustrate ... this approach by comparing the constrained states graph exploration with the concrete...

PTScotch
 Referenced in 51 articles
[sw07038]
 package, which allows one to order large graphs in parallel, yielding orderings the quality ... only slightly worse than the one of stateoftheart sequential algorithms. Our implementation ... several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements...

DibaP
 Referenced in 14 articles
[sw08343]
 Graph partitioning requires the division of a graph’s vertex set into kk equally sized ... NPNPhard to optimize. Most stateoftheart graph partitioning libraries use a variant ... popular benchmark graphs show that DibaP computes consistently better results than the state ... partitionings of six widely used benchmark graphs...

SpintoGrape
 Referenced in 6 articles
[sw07515]
 SpintoGrape, which allows the stategraph of a Promela model to be manipulated...

LoLA
 Referenced in 25 articles
[sw04381]
 supported. For state space reduction, LoLA features symmetries, stubborn sets, and coverability graphs...

Pregel
 Referenced in 28 articles
[sw13416]
 various social networks. The scale of these graphs  in some cases billions of vertices, trillions ... state and that of its outgoing edges or mutate graph topology. This vertexcentric approach...

Petrify
 Referenced in 26 articles
[sw09784]
 Graphs describing the behavior of asynchronous controllers. Petrify is able to solve the Complete State ... called draw_astg to draw Signal Transition Graphs in several graphic formats...

TiGERS
 Referenced in 9 articles
[sw12585]
 ideal is the normal fan of its state polytope. In this paper we present ... ideal by enumerating the edge graph of its state polytope. The key contributions...

SymDIVINE
 Referenced in 3 articles
[sw26690]
 preventing thus repeated exploration of the state space graph. This is crucially important in particular ... verification of parallel programs where the state space graph is full of diamondshaped subgraphs...

Fgindex
 Referenced in 9 articles
[sw18892]
 notion of δTolerance Closed Frequent Graphs (δTCFGs), which allows us to flexibly tune ... more efficient than using the stateoftheart graph index...

TOP/DOMDEC
 Referenced in 9 articles
[sw20520]
 parallel processing. It offers several stateoftheart graph decomposition algorithms in a user...

GString
 Referenced in 4 articles
[sw18900]
 sequences, thus converting graph search to subsequence matching. Stateoftheart sequencing methods work ... granularity  each node (or edge) in the graph will appear as an element ... demonstrate that our approach outperforms stateoftheart graph search methods...

KMS states
 Referenced in 5 articles
[sw31679]
 states on the Toeplitz algebra of a higherrank graph. The Toeplitz algebra ... finite graph of rank k carries a natural action of the torus Tk, and composing ... larger than a critical value, the KMS states for this dynamics are wellunderstood ... graph, our results give a complete description of the simplex of KMS states...

Augur 2
 Referenced in 12 articles
[sw08403]
 analysis of graph transformation systems. We describe the design and the present state ... Augur 1, a tool which can analyze graph transformation systems by approximating them by Petri...

SDPpack
 Referenced in 51 articles
[sw04333]
 computing provably good approximations to NPhard graph problems in polynomial time. Semidefinite programs ... package SDPpack was announced, it implemented a stateoftheart interiorpoint method...