# Accession Number:

## ADA461508

# Title:

## Computing Minimum and Maximum Reachability Times in Probabilistic Systems

# Descriptive Note:

## Conference paper

# Corporate Author:

## CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE

# Personal Author(s):

# Report Date:

## 1999-01-01

# Pagination or Media Count:

## 18.0

# Abstract:

A Markov decision process is a generalization of a Markov chain in which both probabilistic and nondeterministic choice coexist. Given a Markov decision process with costs associated with the transitions and a set of target states the stochastic shortest path problem consists in computing the minimum expected cost of a control strategy that guarantees to reach the target. In this paper, we consider the classes of stochastic shortest path problems in which the costs are all non-negative, or all non-positive. Previously, these two classes of problems could be solved only under the assumption that the policies that minimize or maximize the expected cost also lead to the target with probability 1. This assumption does riot necessarily hold for Markov decision processes that arise as model for distributed probabilistic systems. We present efficient methods for solving these two classes of problems without relying on additional assumptions. The methods are based on algorithms to transform the original problems into problems that satisfy the required assumptions. The methods lead to the efficient solution of two basic problems in the analysis of the reliability arid performance of partially-specified systems the computation of the minimum or maximum probability of reaching a target set, and the computation of the minimum or maximum expected time to reach the set.

# Descriptors:

# Subject Categories:

- Statistics and Probability
- Cybernetics