• CAESAR

  • Referenced in 11 articles [sw29138]
  • graph (also called labelled transition system, reachability graph, state space, etc.) corresponding to the behaviour...
  • CLPS-B

  • Referenced in 7 articles [sw00132]
  • number of states in a reachability graph. We illustrate this approach by comparing the constrained...
  • Graphs

  • Referenced in 109 articles [sw12277]
  • first presented with a network (graph). A so-called preprocessing algorithm may compute certain information ... tradeoffs, query processing on spatial networks, and reachability queries; and theoretical computer scientists analyze distance ... query time. We survey methods for general graphs as well as specialized methods for restricted...
  • MaRDiGraS

  • Referenced in 1 article [sw27734]
  • MaRDiGraS: simplified building of reachability graphs on large clusters. Dealing with complex systems often needs ... building of huge reachability graphs, thus revealing all the challenges associated with big data access ... tools or implementing brand new distributed reachability graph builders. The outcome of several tests performed...
  • GAVS

  • Referenced in 9 articles [sw00323]
  • games on finite graphs used in theoretical computer science, including, e.g., reachability games and parity ... graphical editor for both defining game graphs and also visualizing the computation of the winning...
  • GARNET

  • Referenced in 1 article [sw22308]
  • GARNET: A graphical attack graph and reachability network evaluation tool. Attack graphs enable computation ... This paper presents GARNET (Graphical Attack graph and Reachability Network Evaluation Tool), an interactive visualization ... tool that facilitates attack graph analysis. It provides a simplified view of critical steps that ... existing C++ engine that performs reachability and attack graph computations. An initial round of user...
  • HAGAR

  • Referenced in 1 article [sw02336]
  • multi-context graph processors. Graph algorithms, such as vertex reachability, transitive closure, and shortest path ... specifically in FPGAs, to implement such graph algorithms for speedup relative to their software counterparts ... HAGAR). We describe HAGAR implementations for graph reachability and shortest path. Reachability is a building ... closure, connected components, and other high- level graph algorithms. To handle large graphs where such...
  • dbminer

  • Referenced in 1 article [sw18080]
  • systems (encoded in SIS format for state graphs) have to be considered. The output ... Petri net in Petrify format whose reachability graph has a language that is a superset...
  • RDPS

  • Referenced in 1 article [sw18432]
  • invariants of the net, generates the reachability graph, and analyzes several properties of the graph...
  • TTool

  • Referenced in 1 article [sw10560]
  • generation of its reachability graph, which can be analysed, verified and minimized using CADP...
  • LoLA

  • Referenced in 27 articles [sw04381]
  • techniques cover standard properties (liveness, reversibility, boundedness, reachability, dead transitions, deadlocks, home states) as well ... LoLA features symmetries, stubborn sets, and coverability graphs...
  • NAVIGATOR

  • Referenced in 0 articles [sw22304]
  • Visualizing attack graphs, reachability, and trust relationships with NAVIGATOR. A new tool named NAVIGATOR (Network ... significant capabilities to earlier work in attack graph visualization. Using NAVIGATOR, users can visualize ... existing C++ engine for reachability and attack graph calculations...
  • Stone Kleene

  • Referenced in 1 article [sw28599]
  • Kleene star operation to describe reachability in weighted graphs. Many properties of the Kleene star...
  • DryVR

  • Referenced in 2 articles [sw28120]
  • black-box simulator, a white-box transition graph, a time bound and a safety specification ... output it generates over-approximations of the reachable states and returns “Safe” if the system ... uses RRTs to find a transition graph such that the combined system satisfies the given...
  • ProGraML

  • Referenced in 1 article [sw32379]
  • performing complex downstream tasks over these graphs. The ProGraML representation is a directed attributed multigraph ... traditional compiler analysis tasks: control flow reachability, dominator trees, data dependencies, variable liveness, and common...
  • Estaciones

  • Referenced in 1 article [sw37636]
  • overtaking station track layout diagram design using graphs. An alternative track diagram proposal for these ... introduced. It offers different procedures related to reachability, trails, number of shortest paths...
  • ACL2

  • Referenced in 291 articles [sw00060]
  • ACL2 is both a programming language in which...
  • cdd

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CoCoA

  • Referenced in 659 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...