Concepedia

Reachability Analysis

Reachability Analysis is a formal method used in system verification that determines the set of all possible states a dynamical system can reach from a given initial state under admissible inputs and disturbances, distinguishing it from other verification techniques by its focus on state-space exploration over time.

1.7K

Publications

78.6K

Citations

3.1K

Authors

975

Institutions

Publications per year

2017–2026

440

Parents

Publications

1.7K

The algorithmic analysis of hybrid systems

Rajeev Alur, Costas Courcoubetis, Nicolas Halbwachs et al. · Theoretical Computer Science · 1995 · 1.9K citations · Full text

, , +17

A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games

Ian M. Mitchell, Alexandre M. Bayen, Claire J. Tomlin · IEEE Transactions on Automatic Control · 2005 · 1.1K citations

, , +16

Automatic grasp planning using shape primitives

Andrew Miller, Steffen Knoop, Henrik I. Christensen et al. · 2004 · 715 citations · Full text

, , +17

State-space realization theory of two-dimensional filters

Ettore Fornasini, G. Marchesini · IEEE Transactions on Automatic Control · 1976 · 676 citations

, , +16

What's Decidable about Hybrid Automata?

Thomas A. Henzinger, Peter W. Kopke, Anuj Puri et al. · Journal of Computer and System Sciences · 1998 · 675 citations · Full text

, , +17

1–5 of 1.7K

Authors

3.1K

  1. MA
    Matthias Althoff

    Technical University of Munich, Germany

    56 publications · 4K citations

    34

    h-index

  2. MZ
    MengChu Zhou

    New Jersey Institute of Technology, United States

    31 publications · 1.7K citations

    23

    h-index

  3. CJ
    Claire J. Tomlin

    University of California, Berkeley, United States

    28 publications · 3.3K citations

    19

    h-index

  4. TT
    Taylor T. Johnson

    Vanderbilt University, United States

    24 publications · 1.1K citations

    16

    h-index

  5. ZL
    Zhiwu Li

    Xidian University, China

    16 publications · 1.3K citations

    13

    h-index

1–5 of 3.1K

Institutions

975

  1. University of California, Berkeley

    Berkeley, United States

    34 h-index

    167 publications

    16K citations

  2. Technical University of Munich

    Munich, Germany

    32 h-index

    147 publications

    7.3K citations

  3. Carnegie Mellon University

    Pittsburgh, United States

    27 h-index

    91 publications

    6.1K citations

  4. Centre National de la Recherche Scientifique

    Paris, France

    27 h-index

    115 publications

    3.9K citations

  5. University of Illinois Urbana-Champaign

    Urbana, United States

    22 h-index

    82 publications

    2.6K citations

  6. New Jersey Institute of Technology

    Newark, United States

    20 h-index

    30 publications

    1.8K citations

  7. Verimag

    Gières, France

    20 h-index

    49 publications

    12.5K citations

  8. Stanford University

    Stanford, United States

    19 h-index

    75 publications

    4.3K citations

1–8 of 975

Venues

  1. IEEE Transactions on Automatic Control

    94 publications · 7.6K citations

    45

    h-index

  2. Automatica

    39 publications · 3.3K citations

    24

    h-index

  3. Electronic Notes in Theoretical Computer Science

    ENTCS · 33 publications · 1.2K citations

    22

    h-index

  4. 20

    h-index

  5. Theoretical Computer Science

    24 publications · 3.4K citations

    18

    h-index

1–5