Upper and Lower Bounds for Probabilistic Reachability Analysis

Daniel E Thomas, Jorge Tierno

Research output: Contribution to journalArticlepeer-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.

Fingerprint Dive into the research topics of 'Upper and Lower Bounds for Probabilistic Reachability Analysis'. Together they form a unique fingerprint.

Cite this