Upper and Lower Bounds for Probabilistic Reachability Analysis

Daniel E Thomas; Jorge Tierno

doi:10.2514/6.2002-3456

Upper and Lower Bounds for Probabilistic Reachability Analysis

Daniel E Thomas, Jorge Tierno

Mechanical Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

In this paper we approach the problem of probabilis- tic analysis of discrete-event control systems (modeled as finite Markov processes) from a control perspective. We show how by computing upper and lower bounds we can trade off accuracy (gap between bounds) for length of computation.

Original language	English
Journal	AIAA's 1st Technical Conference and Workshop on Unmanned Aerospace Vehicles
DOIs	https://doi.org/10.2514/6.2002-3456
State	Published - May 20 2002

Access

10.2514/6.2002-3456

http://arc.aiaa.org/doi/pdf/10.2514/6.2002-3456

OpenUrl availability

Full text

Cite this

@article{d90beb5302d6481bbda8d1d2eeeac857,

title = "Upper and Lower Bounds for Probabilistic Reachability Analysis",

abstract = "In this paper we approach the problem of probabilis- tic analysis of discrete-event control systems (modeled as finite Markov processes) from a control perspective. We show how by computing upper and lower bounds we can trade off accuracy (gap between bounds) for length of computation.",

author = "Thomas, {Daniel E} and Jorge Tierno",

year = "2002",

month = may,

day = "20",

doi = "10.2514/6.2002-3456",

language = "English",

journal = "AIAA's 1st Technical Conference and Workshop on Unmanned Aerospace Vehicles",

}

TY - JOUR

T1 - Upper and Lower Bounds for Probabilistic Reachability Analysis

AU - Thomas, Daniel E

AU - Tierno, Jorge

PY - 2002/5/20

Y1 - 2002/5/20

N2 - In this paper we approach the problem of probabilis- tic analysis of discrete-event control systems (modeled as finite Markov processes) from a control perspective. We show how by computing upper and lower bounds we can trade off accuracy (gap between bounds) for length of computation.

AB - In this paper we approach the problem of probabilis- tic analysis of discrete-event control systems (modeled as finite Markov processes) from a control perspective. We show how by computing upper and lower bounds we can trade off accuracy (gap between bounds) for length of computation.

U2 - 10.2514/6.2002-3456

DO - 10.2514/6.2002-3456

M3 - Article

JO - AIAA's 1st Technical Conference and Workshop on Unmanned Aerospace Vehicles

JF - AIAA's 1st Technical Conference and Workshop on Unmanned Aerospace Vehicles

ER -

Upper and Lower Bounds for Probabilistic Reachability Analysis

Abstract

Access

OpenUrl availability

Fingerprint

Cite this