A popular approach to find a tractable solution to a POMDP is to reduce the size of the belief space by approximating it as a set of discrete reachable beliefs and then perform VI in this reduced space.
Now, let us assume that (S_i) is a set of places statically reachable from (mathrm{dom}(m_0)) and let (t = m_1 {{{,mathop {longrightarrow }limits ^{sigma }}}} m_2) be such that (S_i {{{,mathop {Longrightarrow }limits ^{t},}}}S_{i+1}).
If the mapping from ((a, b)) to ((mu, nu)) is not degenerate, then there exists a nondegenerate (two-parameter) set of reachable values of μ and ν for which control system fixed points exist.
In [17], an algorithm for computing the set of reachable states of a continuous dynamic game is discussed.
The former operates on the underlying graph structure of a markov chain to determine, for example, the set of reachable states in a model, or to check qualitative properties.
With some controllable transitions in the automata, Discrete Controller Synthesis (DCS) tools [6] can compute a controller that restrains the set of reachable states (i.e., all possible behaviours) to those satisfying a control objective (e.g., a coordination policy).
The goal of reachability analysis is to compute the set of reachable states in the state space for a given model and a set of initial states.
Such a representation allows to compute the set of reachable states of the system and to detect loops between states.
In summary, a mobile node obtains its globally routable address [29] by following the steps given below: (a) Has an initial IP address (home address) which is routable in the ad hoc network; (b) Discovers reachable gateways in its surrounding; (c) Selects one gateway out of the set of reachable gateways; and (d) Forms a globally routable IP address with the prefix of the selected gateway. .
The problem of constructing a Petri net feedback controller, which enforces the conjunction of a set of linear inequalities on the reachable marking of the place and transition modeled by Petri net, is discussed.
