-

, 2013

- B
uchi

.
Alan Turing, Kurt G
odel, Alonzo Church, Stephen
Kleene ..

40 50
,
-

(500 .. - 19 )
( 19 )
George Boole, Cantor ..

( 19 -
20 )
Frege, Russel, Hilbert ..

(random
processes)
Poisson processes, ..
(..
) .

*
.
*
.

*
.
*
.

P(Xn = xn |Xn1 = xn1 . . . X0 = x0 ) = P(Xn = xn |Xn1 = xn1 )

*
.
*
.

P(Xn = xn |Xn1 = xn1 . . . X0 = x0 ) = P(Xn = xn |Xn1 = xn1 )

* birth processes, gambling, random walkers, queueing

theory, information theory and information retrieval.

Markov

i
j
p = P(X1 = j|X0 = i)

p(n) = P(Xn = j|X0 = i)

autonomous controlled
fully partially observed

POMDP

.

.
(belief state).
NP-complete

1 , 2 , . . . n 

1 , 2 , . . . n 

X2
Xn
Y
1
X
1 , 2 , . . . n 

1 , 2 , . . . n 

X2
Xn
Y
1
X
1 , 2 , . . . n 

18:32
, ,

, .

(...)

18:32
, ,

, .
vs

*
,
.
P

P(w) := P

pAcc (w)

pRun (w)

Qn

i=1 (pi , wi , pi+1 )

Qn

i=1 (pi , wi , pi+1 )

(1)

PFA

Rabin (1963)
Markov

LA () = {w A |PA (w) }, 0 1.

60- (J. R. B
uchi, Michael O. Rabin, Robert
McNaughton, C. C. Elgot, Wolfgang Thomas)
.

(.. ).
( ).

.
Rabin automata, Muller automata, Streett automata,
B
uchi automata .
.

B
uchi

B
uchi

:
Inf() F 6=



.

PBA(1/4)

PBA .

q

q.

qQ (q,

a, q) = 0 .

PBA(2/4)

:
- P
w Pr P (w)
, Pr P (w) > 0.
- :
(runs) w
.
:
]0, 1[, -
P Pr P (w)
, Pr P (w) > .

PBA(3/4)

PBA
- .
!
PBA-
p, v ]0, 1[ :
PBA=1 PBA>0 PBA>p = PBA>v
PBAs NBAs.

PBA ,
NBAs
.

PBA(4/4)

,
.
POMDPs .
L>0 (P)
B
uchi P
,
.
L
PBA O(n),
NSA (2n /n)katast0 aseic.

.

.

()
.

.

.

.

.

()
.

.

.

,
,
.

=
..,

.

.

, ,
..


.

[1] C. Baier, N. Bertrand, and M. Gr

osser. On decision problems for probabilistic bGOchi automata. In
FOSSACS, pages 287301. Springer, 2008.
[2] C. Baier, N. Bertrand, and M. Gr
osser. Probabilistic acceptors for languages over infinite words. In
M. N. et al., editor, SOFSEM, volume 5404 of Lecture Notes in Computer Science, pages 1933.
Springer-Verlag, 2009.
[3] C. Baier, N. Bertrand, and M. Gr
osser. Probabilistic automata over infinite words: Expressiveness,
efficiency, and decidability. In DCFS, volume 3 of EPTCS, pages 316, 2009.
[4] C. Baier and M. Gr
osser. Recognizing omega-regular languages with probabilistic automata. In LICS,
pages 137146, 2005.
[5] C. Baier, M. Gr
osser, and N. Bertrand. Probabilistic omega-automata. Journal of the ACM,
59(1):152, 2012.
[6] N. J. Nilsson. Probabilistic logic. Artificial intelligence, 28(1):7187, 1986.
[7] W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, volume B:
Formal Models and Semantics, pages 133192. Elsevier Science, 1990.
[8] W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of
Formal Languages, volume III, pages 389455. Springer-Verlag, 1996.
[9] T. Weidner. Probabilistic automata and probabilistic logic. In V. S. B. Rovan and P. Widmayer,
editors, MFCS 2012, pages 813824. Springer-Verlag, 2012.
[10] J. Williamson. Probability logic. Studies in Logic and Practical Reasoning, 1:397424, 2002.

.
;