On feasible cases of checking multi-agent systems behavior

التفاصيل البيبلوغرافية
العنوان: On feasible cases of checking multi-agent systems behavior
المؤلفون: Mars K. Valiev, Michael I. Dekhtyar, Alexander Dikovsky
المساهمون: Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN)
المصدر: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2003, 303 (1), pp.63--81
بيانات النشر: Elsevier Science B.V.
مصطلحات موضوعية: Model checking, Polynomial, General Computer Science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Theoretical Computer Science, Temporal logics, 0202 electrical engineering, electronic engineering, information engineering, Deterministic system (philosophy), Temporal logic, Time complexity, Mathematics, Multi-agent system, Complexity, NP, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, Computer Science::Multiagent Systems, 010201 computation theory & mathematics, Transition system, 020201 artificial intelligence & image processing, Algorithm, Computer Science(all)
الوصف: The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions.
اللغة: English
تدمد: 0304-3975
1879-2294
DOI: 10.1016/S0304-3975(02)00445-0
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47057173d5b7312d96cab308ff4e9175Test
حقوق: OPEN
رقم الانضمام: edsair.doi.dedup.....47057173d5b7312d96cab308ff4e9175
قاعدة البيانات: OpenAIRE
الوصف
تدمد:03043975
18792294
DOI:10.1016/S0304-3975(02)00445-0