Abstract
The problem of verifying the coordination mechanism in a system of software support of network collaboration is considered. This problem is demonstrated to be similar to the agent verification problem. It is proved that the problem of verifying the coordination mechanism is co-complete.
Similar content being viewed by others
References
M. M. Glibovets and D. K. Hlomozda, “Formal model of a coordinationally founded network for a training collaboration system,” Probl. Progr., No. 2–3, 402–412 (2006).
M. M. Glibovets, “Models and methods of creation and support of a high-performance distributed training environment,” Synopsis of Doctoral Thesis in Physical and Mathematical Sciences, V. M. Glushkov Institute of Cybernetics of NASU, Kiev (2006).
M. Wooldridge and P. E. Dunne, “The computational complexity of agent verification,” in: Proc. 8th International Workshop (Intelligent Agents VIII) on Agent Theories, Architectures, and Languages (ATAL-2001), Springer, Berlin (2002), pp. 115–127.
C. H. Papadimitriou, Computational Complexity, Addison-Wesley, New York (1994).
Author information
Authors and Affiliations
Corresponding author
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 15–19, July–August 2008.
Rights and permissions
About this article
Cite this article
Glibovets, N.N., Hlomozda, D.K. Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration. Cybern Syst Anal 44, 477–481 (2008). https://doi.org/10.1007/s10559-008-9019-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-008-9019-7