On feasible cases of checking multi-agent systems behavior

Authors:
Michael Dekhtyar;Alexander Dikovsky;Mars Valiev
Affiliations:
Department of Computer Science, University of Tver, Tver 170000, Russia;IRIN, Université de Nantes, 2, rue de la Houssinière, BP 92208 44322 Nantes Cedex 03, France and Keldysh Institute for Applied Mathematics, Moscow 125047, Russia;Keldysh Institute for Applied Mathematics, Moscow 125047, Russia
Venue:
Theoretical Computer Science - Logic and complexity in computer science
Year:
2003

Citing 18
Cited 2

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
Logic programming

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Agent-oriented programming

Artificial Intelligence
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Model checking

Model checking
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems
Heterogeneous Agent Systems

Heterogeneous Agent Systems
A Roadmap of Agent Research and Development

Autonomous Agents and Multi-Agent Systems
Specifying and Verifying Distributed Intelligence Systems

EPIA '93 Proceedings of the 6th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
On Homeostatic Behavior of Dynamic Deductive Data Bases

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Specification and verification of concurrent systems in CESAR

Proceedings of the 5th Colloquium on International Symposium on Programming
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
The Computational Complexity of Agent Design Problems

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Architectures and applications of intelligent agents: A survey

The Knowledge Engineering Review

Temporal verification of probabilistic multi-agent systems

Pillars of computer science
Formal modeling of robot behavior with learning

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.