On complexity of verification of interacting agents’ behavior-Reference-Cited by-同舟云学术

On complexity of verification of interacting agents’ behavior

Published:2006-09 Issue:3 Volume:141 Page:336-362
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Dekhtyar Michael,Dikovsky Alexander,Valiev Mars

Publisher

Elsevier BV

Subject

Logic

Reference28 articles.

1. T. Araragi, P. Attie, I. Keidar, K. Kogure, V. Luchangco, N. Lynch, K. Mano, On formal modeling of agent computations. in: NASA Workshop on Formal Approaches to Agent-Based Systems, April 2000

2. Logic programming;Apt,1990

3. METATEM: An introduction;Barringer;Formal Aspects of Computing,1995

4. M. Benerecetti, F. Guinchiglia, L. Serafini, Model checking multiagent systems, Technical Report # 9708-07, Instituto Trentino di Cultura, 1998

5. O. Bernholz, M.Y. Vardi, P. Wolper, An automata-theoretic approach to branching time model checking, in: Proc. Int. Workshop Computer aided verification, in: LNCS, Stanford, 1994

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Biography of Alexandre Dikovsky;Journal of Logic, Language and Information;2017-08-07

2. Verifying Resource Requirements for Ontology-Driven Rule-Based Agents;Lecture Notes in Computer Science;2012

3. Complexity of verification of nondeterministic probabilistic multiagent systems;Automatic Control and Computer Sciences;2011-12

4. Systems of agents controlled by logical programs: Complexity of verification;Programming and Computer Software;2009-09

5. Temporal Verification of Probabilistic Multi-Agent Systems;Pillars of Computer Science