Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:1007157
Jump to:navigation, search

DOI10.1007/S10559-008-9019-7zbMATH Open1162.68401OpenAlexW1986956167MaRDI QIDQ1007157FDOQ1007157

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




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


zbMATH Keywords

computational complexitycoordinationPetri netco-NP-completenessprogram agent


Mathematics Subject Classification ID

Theory of software (68N99)


Cites Work

  • Title not available (Why is that?)
  • Title not available (Why is that?)






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1007157&oldid=13002316"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 21:08. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki