Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration

DOI10.1007/S10559-008-9019-7MaRDI QIDQ1007157zbMATH OpenOpenAlexFDO

Authors N. N. Glibovets, D. K. Hlomozda

Publication date 27 March 2009

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL http://ekmair.ukma.edu.ua/handle/123456789/654

zbMATH Keywords

co-NP-completenesscomputational complexitycoordinationPetri netprogram agent

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Systems of agents controlled by logical programs: complexity of verification
• scientific article; zbMATH DE number 2088153
• Complexity of Verifying Game Equilibria
• On complexity of verification of interacting agents' behavior
• A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling

This page was built for publication: Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007157)