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...
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 |
Similar Items
-
Polynomial Algorithm of Verication for Subset of PLTL Logic
by: P. V. Lebedev
Published: (2012-01-01) -
Polynomial Algorithm of Verication for Subset of PLTL Logic
by: P. V. Lebedev
Published: (2015-02-01) -
Application of Markov processes for analysis and control of aircraft maintainability
by: Yu. M. Chinyuchin, et al.
Published: (2020-02-01) -
PROCESSES AND SYSTEMS of avionics technical operation as Markov chais MATHEMATICAL MODELS
by: S. V. Kuznetsov
Published: (2016-11-01) -
On the Expressive Power of Some Extensions of Linear Temporal Logic
by: Anton Gnatenko, et al.
Published: (2018-10-01)