Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the connections between PCTL and Dynamic Programming   Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which
has become a standard for expressing temporal properties of finite-state Markov
chains in the context of automated model checking. In this paper, we give a
definition of PCTL for noncountable-space Markov chains, and we show that there
is a substantial affinity between certain of its operators and problems of
Dynamic Programming. After proving some uniqueness properties of the solutions
to the latter, we conclude the paper with two examples to show that some
recovery strategies in practical applications, which are naturally stated as
reach-avoid problems, can be actually viewed as particular cases of PCTL
formulas.

31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
26
The categories of this paper are: bayes-an
8
The categories of this paper are: hep-ex