On complexity of veri¯cation of nondeterministic probabilistic multiagent systems

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...

Full description

Bibliographic Details
Main Authors: M. K. Valiev, M. I. Dekhtyar
Format: Article
Language:English
Published: Yaroslavl State University 2010-12-01
Series:Моделирование и анализ информационных систем
Subjects:
Online Access:https://www.mais-journal.ru/jour/article/view/1050
_version_ 1797877952901283840
author M. K. Valiev
M. I. Dekhtyar
author_facet M. K. Valiev
M. I. Dekhtyar
author_sort M. K. Valiev
collection DOAJ
description 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.
first_indexed 2024-04-10T02:24:56Z
format Article
id doaj.art-6faed3a2b7104734931a360d5aa3c81e
institution Directory Open Access Journal
issn 1818-1015
2313-5417
language English
last_indexed 2024-04-10T02:24:56Z
publishDate 2010-12-01
publisher Yaroslavl State University
record_format Article
series Моделирование и анализ информационных систем
spelling doaj.art-6faed3a2b7104734931a360d5aa3c81e2023-03-13T08:07:31ZengYaroslavl State UniversityМоделирование и анализ информационных систем1818-10152313-54172010-12-011744151791On complexity of veri¯cation of nondeterministic probabilistic multiagent systemsM. K. Valiev0M. I. Dekhtyar1Институт прикладной математики им. М.В. Келдыша РАНТверской государственный университет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.https://www.mais-journal.ru/jour/article/view/1050вероятностные мультиагентные системымарковские цепи и процессы принятия решенийтемпоральные логикиверификация динамических свойств
spellingShingle M. K. Valiev
M. I. Dekhtyar
On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
Моделирование и анализ информационных систем
вероятностные мультиагентные системы
марковские цепи и процессы принятия решений
темпоральные логики
верификация динамических свойств
title On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
title_full On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
title_fullStr On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
title_full_unstemmed On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
title_short On complexity of veri¯cation of nondeterministic probabilistic multiagent systems
title_sort on complexity of veri¯cation of nondeterministic probabilistic multiagent systems
topic вероятностные мультиагентные системы
марковские цепи и процессы принятия решений
темпоральные логики
верификация динамических свойств
url https://www.mais-journal.ru/jour/article/view/1050
work_keys_str_mv AT mkvaliev oncomplexityofvericationofnondeterministicprobabilisticmultiagentsystems
AT midekhtyar oncomplexityofvericationofnondeterministicprobabilisticmultiagentsystems