## Departmental Technical Reports (CS)

#### Publication Date

9-2016

Technical Report: UTEP-CS-16-64

To appear in Journal of Uncertain Systems

#### Abstract

In some practical situations, we need to find the {\em avoidance set}, i.e., the set of all initial states for which the system never goes into the forbidden region. Algorithms are known for computing the avoidance set in several practically important cases. In this paper, we consider a general case, and we show that, in some reasonable sense, the corresponding general problem is always algorithmically solvable. A similar algorithm is possible for another general system-related problem: the problem of describing the set of all possible states which are consistent with the available measurement results.

COinS