3 research outputs found
Π ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½Π½ΡΡ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΡ ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΡ ΡΠΈΡΡΠ΅ΠΌ
Probabilistic systems of interacting nondeterministic intelligent agents are consid-
ered. States of the agents in these systems are some probabilistic databases, and the
activity of the agents is controlled by some probabilistic logic programs. Moreover, com-
munication channels between agents are also probabilistic. We show how such systems
can be polynomially transformed to Β―nite state Markov decision processes. This allows
one to transfer the known results on verifying temporal properties of the Β―nite state
Markov processes to the probabilistic multi-agent systems of considered type.Π Π°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°ΡΡΡΡ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ Π²Π·Π°ΠΈΠΌΠΎΠ΄Π΅ΠΉΡΡΠ²ΡΡΡΠΈΡ
Π½Π΅Π΄Π΅ΡΠ΅ΡΠΌΠΈΠ½ΠΈΡΠΎΠ²Π°Π½Π½ΡΡ
ΠΈΠ½ΡΠ΅Π»Π»Π΅ΠΊΡΡΠ°Π»ΡΠ½ΡΡ
Π°Π³Π΅Π½ΡΠΎΠ². Π‘ΠΎΡΡΠΎΡΠ½ΠΈΡΠΌΠΈ Π°Π³Π΅Π½ΡΠΎΠ² Π² ΡΠ°ΠΊΠΈΡ
ΡΠΈΡΡΠ΅ΠΌΠ°Ρ
ΡΠ²Π»ΡΡΡΡΡ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠ΅ Π±Π°Π·Ρ Π΄Π°Π½Π½ΡΡ
(ΡΠ°ΠΊΡΠΎΠ²), Π° ΠΈΡ
Π΄Π΅ΠΉΡΡΠ²ΠΈΡ ΡΠΏΡΠ°Π²Π»ΡΡΡΡΡ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠΌΠΈ Π»ΠΎΠ³ΠΈΡΠ΅ΡΠΊΠΈΠΌΠΈ ΠΏΡΠΎΠ³ΡΠ°ΠΌΠΌΠ°ΠΌΠΈ. ΠΡΠΎΠΌΠ΅ ΡΠΎΠ³ΠΎ, ΠΊΠ°Π½Π°Π»Ρ Π²Π·Π°ΠΈΠΌΠΎΠ΄Π΅ΠΉΡΡΠ²ΠΈΠΉ ΠΌΠ΅ΠΆΠ΄Ρ Π°Π³Π΅Π½ΡΠ°ΠΌΠΈ ΡΠ°ΠΊΠΆΠ΅ ΡΠ²Π»ΡΡΡΡΡ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠΌΠΈ. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΠΊΠ°ΠΊ ΡΠ°ΠΊΠΈΠΌ ΡΠΈΡΡΠ΅ΠΌΠ°ΠΌ Π·Π° ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΠΎΠ΅ Π²ΡΠ΅ΠΌΡ ΠΌΠΎΠ³ΡΡ Π±ΡΡΡ ΡΠΎΠΏΠΎΡΡΠ°Π²Π»Π΅Π½Ρ ΠΌΠΎΠ΄Π΅Π»ΠΈΡΡΡΡΠΈΠ΅ ΠΈΡ
ΠΊΠΎΠ½Π΅ΡΠ½ΡΠ΅ ΠΠ°ΡΠΊΠΎΠ²ΡΠΊΠΈΠ΅ ΠΏΡΠΎΡΠ΅ΡΡΡ ΠΏΡΠΈΠ½ΡΡΠΈΡ ΡΠ΅ΡΠ΅Π½ΠΈΠΉ. ΠΡΠΎ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ ΠΏΠ΅ΡΠ΅Π½Π΅ΡΡΠΈ ΠΈΠ·Π²Π΅ΡΡΠ½ΡΠ΅ ΡΠ΅Π·ΡΠ»ΡΡΠ°ΡΡ ΠΎ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈΡ
ΡΠ²ΠΎΠΉΡΡΠ² ΠΊΠΎΠ½Π΅ΡΠ½ΡΡ
ΠΠ°ΡΠΊΠΎΠ²ΡΠΊΠΈΡ
ΠΏΡΠΎΡΠ΅ΡΡΠΎΠ² Π½Π° Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΠ½ΡΠ΅ ΠΌΡΠ»ΡΡΠΈΠ°Π³Π΅Π½ΡΠ½ΡΠ΅ ΡΠΈΡΡΠ΅ΠΌΡ ΡΠ°ΡΡΠΌΠ°ΡΡΠΈΠ²Π°Π΅ΠΌΠΎΠ³ΠΎ ΡΠΈΠΏΠ°
ΠΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΡΠ΅ΠΏΠ΅ΠΉ ΠΠ°ΡΠΊΠΎΠ²Π° Π΄Π»Ρ ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° Π»ΠΎΠ³ΠΈΠΊΠΈ PLTL
In this article a polynomial algorithm is described of verification of dynamic properties of Markov chains described by formulas of a subset of temporal logic PLTL (propositional temporal logic of linear time). The algorithm allows to find probability of the validity of the formula on the Markov chain, and also set of trajectories on which the verified formula is true.ΠΠΏΠΈΡΡΠ²Π°Π΅ΡΡΡ ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΡΠΉ Π°Π»Π³ΠΎΡΠΈΡΠΌ Π²Π΅ΡΠΈΡΠΈΠΊΠ°ΡΠΈΠΈ ΡΠ΅ΠΏΠ΅ΠΉ ΠΠ°ΡΠΊΠΎΠ²Π°, Π΄ΠΈΠ½Π°ΠΌΠΈΡΠ΅ΡΠΊΠΈΠ΅ ΡΠ²ΠΎΠΉΡΡΠ²Π° ΠΊΠΎΡΠΎΡΡΡ
ΠΎΠΏΠΈΡΡΠ²Π°ΡΡΡΡ ΡΠΎΡΠΌΡΠ»Π°ΠΌΠΈ Π½Π΅ΠΊΠΎΡΠΎΡΠΎΠ³ΠΎ ΠΏΠΎΠ΄ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° ΡΠ΅ΠΌΠΏΠΎΡΠ°Π»ΡΠ½ΠΎΠΉ Π»ΠΎΠ³ΠΈΠΊΠΈ PLTL (propositional temporal logic of linear time). ΠΠ»Π³ΠΎΡΠΈΡΠΌ ΠΏΠΎΠ·Π²ΠΎΠ»ΡΠ΅Ρ Π½Π°ΠΉΡΠΈ Π²Π΅ΡΠΎΡΡΠ½ΠΎΡΡΡ ΠΈΡΡΠΈΠ½Π½ΠΎΡΡΠΈ ΡΠΎΡΠΌΡΠ»Ρ Π½Π° Π·Π°Π΄Π°Π½Π½ΠΎΠΉ ΡΠ΅ΠΏΠΈ ΠΠ°ΡΠΊΠΎΠ²Π°, Π° ΡΠ°ΠΊΠΆΠ΅ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²ΠΎ ΡΡΠ°Π΅ΠΊΡΠΎΡΠΈΠΉ, Π½Π° ΠΊΠΎΡΠΎΡΡΡ
ΠΈΡΡΠΈΠ½Π½Π° Π²Π΅ΡΠΈΡΠΈΡΠΈΡΡΠ΅ΠΌΠ°Ρ ΡΠΎΡΠΌΡΠ»Π°
Temporal Verification of Probabilistic Multi-Agent Systems β
To Boris Avraamovich, our teacher in life and research, on occasion o