Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 561 for “"Reachability"”.

  1. Investigating data-flow reachability questions

    … modified?” These questions are instances of reachability questions, which require developers to locate points of interest within program paths. Despite how frequently developers encounter reachability questions, existing tools place the burden on the developer to translate the question of …

    ubc Repository record for Investigating data-flow reachability questions (opens in a new tab) Download PDF for Investigating data-flow reachability questions (opens in a new tab)

  2. Reachability and Turn Constraint Paths

    Problems dealing with the development of efficient algorithms for constructing collision-free paths have been explored extensively. We review existing algorithms for constructing collision-free paths under turn-angle constraints. We examine the problem of computing collision-free paths in the …

    unlv Repository record for Reachability and Turn Constraint Paths (opens in a new tab) Download PDF for Reachability and Turn Constraint Paths (opens in a new tab)

  3. Efficient Reachability Query in Hypergraphs

    Computing the reachability between two vertices is a fundamental problem in graph analysis. However, existing studies mainly focus on general graphs, where an edge connects exactly two vertices. Group-based connections, such as a group of authors collaborating on the same paper, naturally exist in …

    unsw Repository record for Efficient Reachability Query in Hypergraphs (opens in a new tab)

  4. Reachability problems for linear dynamical systems

    … this thesis, we will be interested in the <em>Reachability Problem</em> for linear dynamical systems, which may be formulated in a general way as follows: <p>given a <em>target set</em> T contained in &Ropf;<sup>m</sup> and a (discrete- or continuous-time) linear dynamical system specified by …

    oxford Repository record for Reachability problems for linear dynamical systems (opens in a new tab)

  5. Leveraging SMT Solvers for Reachability Analysis

    Reachability analysis is fundamental to formal verification of distributed systems, network protocols, and concurrent software, enabling verification of safety and liveness properties. However, the explosive growth of state spaces makes reachability analysis computationally prohibitive for many …

    penn Repository record for Leveraging SMT Solvers for Reachability Analysis (opens in a new tab)

  6. Reachability based planning for robotic manipulators

    In the domain of modern robotics there still exist challenges in control on arguably one of the most fundamental levels, that is motion control. Since the 1980s there has been research into how to take advantage of the system dynamics of robots to provide better methods for motion control. In this …

    qu-belfast Repository record for Reachability based planning for robotic manipulators (opens in a new tab) Download PDF for Reachability based planning for robotic manipulators (opens in a new tab)

  7. Reachability-based diagnosability for hybrid systems

    … discrete event systems (DES) diagnosability with reachability analysis to compare continuous behaviors. Furthermore, we present a case study of fault diagnosability analysis of systems modeled by hybrid automata. This example demonstrates the advantage of performing the state reachability analysis …

    brazil-uerj Repository record for Reachability-based diagnosability for hybrid systems (opens in a new tab)

  8. Symbolic reachability analysis for rewrite theories

    … in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically about specifications with initial model semantics, …

    uiuc Repository record for Symbolic reachability analysis for rewrite theories (opens in a new tab)

  9. Program analysis for quantitative-reachability properties

    … “Whether”, namely quantitative properties and reachability properties. In other words, we are analyzing the kind of program property that contains two sub-properties – quantitative and reachability. A property is a hyper-property if it has two or more sub-properties. For the class of properties …

    bu Repository record for Program analysis for quantitative-reachability properties (opens in a new tab)

  10. A reachability problem for the Heisenberg group

    The reachability problem is a control system problem on a given manifold. Taking the three-dimensional Heisenberg group as our manifold with certain controls placed on a system, we want to know what sets of point on the manifold one can reach. In (jrder to do this, the basic form of a horizontal …

    ttu Repository record for A reachability problem for the Heisenberg group (opens in a new tab)

  11. Hybrid Reachability Analysis for Kuramoto-Lanchester Model

    … equations. In the thesis, we investigate reachability analysis methods for hybrid automata. In particular, we extend JuliaReach, a framework for fast prototyping set-based reachability analysis algorithms, to support verification of hybrid automata. For this purpose, we add to JuliaReach …

    anu Repository record for Hybrid Reachability Analysis for Kuramoto-Lanchester Model (opens in a new tab)

  12. Protocol validation via reachability analysis : an implementation

    Reachability analysis is one of the earliest and most common techniques for protocol validation. It is well suited to checking the protocol syntactic properties since they are a direct consequence of the structure of the reachability tree. However, validations of unbounded protocols via …

    ubc Repository record for Protocol validation via reachability analysis : an implementation (opens in a new tab) Download PDF for Protocol validation via reachability analysis : an implementation (opens in a new tab)

  13. LOW-THRUST REACHABILITY ANALYSIS BY ANALYTICAL MEANS

    … algorithmic process can be used to support a reachability assessment of a noncooperative spacecraft in cislunar space.

    nps Repository record for LOW-THRUST REACHABILITY ANALYSIS BY ANALYTICAL MEANS (opens in a new tab)

  14. Reachability and Spreading Processes on Temporal Networks

    … and software tools—for analysing connectivity, reachability and the outcome of spreading processes in temporal network models of complex systems. The presented algorithms enable computationally efficient estimation of reachability in large systems. This allows research on reachability at a much …

    aalto Repository record for Reachability and Spreading Processes on Temporal Networks (opens in a new tab)

  15. Automatic simulation-driven reachability using matrix measures

    Simulation-driven verification is a promising approach that provides formal safety guarantees for otherwise intractable nonlinear and hybrid system models. A key step in simulation-driven algorithms is to compute the reach set over-approximations from a set of initial states through numerical …

    uiuc Repository record for Automatic simulation-driven reachability using matrix measures (opens in a new tab)

Page 1 of 29