Skip to main content
SpringerLink
Log in

Systems of agents controlled by logical programs: Complexity of verification

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

The complexity of the verification problem for the behavior (dynamical properties) of systems of interacting intelligent agents is considered. This paper is a continuation of our publications [1–3], in which this problem was mainly considered as applied to deterministic and nondeterministic systems, and largely focuses on asynchronous systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Valiev, M.K., Dekhtyar, M.I., and Dikovsky, A.Ya., On the Complexity of Behavior of Systems of Interacting Agents, Trudy konferentsii, posvyashchennoi 90-letiyu so dnya rozhdeniya A.A. Lyapunova (Proc. of the Conf. Dedicated to the 90th Birthday of A.A. Lyapunov), Novosibirsk: Nauka, 2001, pp. 18–28.

    Google Scholar 

  2. Dekhtyar, M., Dikovsky, A., and Valiev, M., On Feasible Cases of Checking Multi-Agent Systems Behavior, Theor. Comput. Sci., 2003, vol. 303, no. 1, pp. 63–81.

    Article  MATH  MathSciNet  Google Scholar 

  3. Dekhtyar, M.K., Dikovsky, A.Ja, and Valiev, M.K., On Complexity of Verification of Interacting Agents’ Behavior, Ann. Pure Appl. Logic, 2006, vol. 141, no. 3, pp. 336–362.

    Article  MATH  MathSciNet  Google Scholar 

  4. Barringer, H., Fisher, M., Gabbay, D., Gough, G., and Owens, R., METATEM: An Introduction, in Formal Aspects of Computing, 1995, vol. 7, pp. 533–549.

    Article  MATH  Google Scholar 

  5. Georgeff, M. and Lansky, A., Reactive Reasoning and Planning, Proc. of the Conf. of the American Association of Artificial Intelligence, Seattle, 1987, pp. 677–682.

  6. van der Hoek, W. and Wooldridge, M., Multi-Agent Systems, in Handbook of Knowledge Representation, van Harmelen, F., Lifschitz, V., and Porter, B., Eds., Amsterdam: Elsevier, 2008, pp. 887–928.

    Google Scholar 

  7. Reiter, R., Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems, Cambridge: MIT, 2001.

    MATH  Google Scholar 

  8. Shoham, Y., Agent Oriented Programming, Artif. Intell., 1993, no. 60, pp. 51–92.

  9. Subrahmanian, V.S., Bonatti, P., Dix, J., et. al., Heterogeneous Agent Systems, Cambridge: MIT, 2000.

    Google Scholar 

  10. Tarasov, V.B., Ot mnogoagentnykh system k intellektual’nym organizatsiyam (From Multiagent Systems to Intellectual Organizations), Moscow: Editorial URSS, 2002.

    Google Scholar 

  11. Araragi, T., Attie, P., Keidar, I., Kogure, K., Luchangco, V., Lynch, N., and Mano, K., On Formal Modeling of Agent Computations, NASA Workshop on Formal Approaches to Agent-Based Systems, 2000.

  12. Benerecetti, M., Guinchiglia, F., and Serafini, L., Model Checking Multiagent Systems, Technical Report no. 9708-07, Instituto Trentino di Cultura, 1998.

  13. Bordini, R.H., Fisher, M., Pardavila, C., and Woold-ridge, M., Model Checking AgentSpeak, Proc. of the Second Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS-03), Melbourne, 2003.

  14. Wooldridge, M. and Dunne, P.E., The Computational Complexity of Agent Verification, in Intelligent Agents VIII, Meyer, J.J. and Tambe, M., Eds., Lecture Notes in AI, vol. 2333, Berlin: Springer, 2002.

    Chapter  Google Scholar 

  15. Wooldridge, M., Huget, M.P., Fisher, M., and Parsons, S., Model Checking Multi-Agent Systems: The MABLE Language and Its Applications, Int. J. Artif. Intell. Tools, 2006, vol. 5, no. 2, pp. 195–225. (Preliminary version: Wooldridge, M., Huget, M.P., Fisher, M., and Parsons, S., Model Checking Multiagent Systems with MABLE, Proc. of the First Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS-02), Bologna, 2002.

    Article  Google Scholar 

  16. Fagin, R., Halpern, J.Y., Moses, Y., and Vardy, M.Y., Reasoning about Knowledge, Cambridge: MIT, 1995.

    MATH  Google Scholar 

  17. Eiter, T. and Subrahmanian, V.S., Heterogeneous Active Agents. III: Polynomially Implementable Agents, Tech. Rep. INFSYS RR-1843-99-07, Inst. für Informationssysteme, Technische Universität Wien, A-10-40,Vienna, 1999.

  18. Clarke, E.M. and Emerson, E.A., Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic, Proc. of Workshop on Logics of Programs, Lecture Notes in Computer Science, 1981, no. 181, pp. 52–71.

  19. Vardi, M. and Wolper, P., An Automata-Theoretic Approach to Automatic Program Verification, Proc. of the IEEE Symposium on Logic in Computer Science, 1986, pp. 332–344.

  20. Queille, J.P. and Sifakis, J., Specification and Verification of Concurrent Programs in CESAR, Proc. of the 5th Int. Symposium on Programming, Lecture Notes in Computer Science, 1982, no. 137, pp. 195–220.

  21. Sistla, A.P. and Clarke, E.M., The Complexity of Propositional Linear Temporal Logic, J. Assoc. Comput. Mach., 1985, vol. 32, no. 3, pp. 733–749.

    MATH  MathSciNet  Google Scholar 

  22. Emerson, E.A., Temporal and Modal Logic, in Handbook of Theoretical Computer Science, Leeuwen, J., Ed., Amsterdam: Elsevier, 1990.

    Google Scholar 

  23. Emerson, E.A., Model Checking and the Mu-Calculus, in Descriptive Complexity and Finite Models, Proc. of the DIMACS Workshop, Immerman, N. and Kolaitis, P.H., Eds., Amsterdam: Elseiver, 1996, pp. 185–214.

    Google Scholar 

  24. Clarke, E.M., Grumberg, O., and Peled, D., Model Checking, Cambridge: MIT, 2000. Translated under the title Verifikatsiya modelei programm: Model Checking, Moscow: MTSNMO, 2002.

    Google Scholar 

  25. Apt, K.R., Logic Programming, in Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Chapter 10, Leeuwen, J., Ed., Amsterdam: Elsevier, 1990, pp. 493–574.

    Google Scholar 

  26. Kozen, D., Results on the Propositional μ-Calculus, Theor. Comput. Sci., 1983, vol. 27, pp. 333–354.

    Article  MATH  MathSciNet  Google Scholar 

  27. Manna, Z. and Pnueli, A., The Temporal Logic of Reactive and Concurrent Systems: Specification, Berlin: Springer, 1991.

    MATH  Google Scholar 

  28. Yi, K., Shilov, N.V., and Bodin E.V., Program Logics Made Simple, in Sistemnaya informatika (System Informatics), Novosibirsk, 2002, issue 8, pp. 206–249.

  29. Garey, M. and Johnson, D.S., Computers and Intractability—A Guide to the Theory of NP-Completeness, New York: Freeman, 1979.

    MATH  Google Scholar 

  30. Papadimitriou, C.H., Computational Complexity, Reading: Addison-Wesley, 1994.

    MATH  Google Scholar 

  31. Dekhtyar, M.I., Dikovsky, A.Ja., and Valiev, M.K., Temporal Verification of Probabilistic Multi-Agent Systems, in Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday, Avron, A., Dershowitz, N., and Rabinovich, A., Eds., Lecture Notes in Computer Science, Berlin: Springer, 2008, vol. 4800.

    Google Scholar 

  32. Burmistrov, M.Yu., Valiev, M.K., Dekhtyar, M.I., and Dikovsky, A.Ya., On the Verification of Dynamical Properties of Systems of Interacting Agents, Trudy X natsional’noi konferentsii po iskusstvennomu intellektu s mezdunarodnym uchastiem (Proc. of the X National Conf. on Artificial Intelligence with International Participation), Obninsk: Fizmatlit, 2006, pp. 908–915.

    Google Scholar 

  33. Rao, A.S., AgentSpeak (L): BDI Agents Speak out in a Logical Computable Language, in Lecture Notes in AI, Berlin: Springer, 1996, vol. 1038.

    Google Scholar 

  34. Garanina, N.O. and Shilov, N.V., Verification of Combinatorial Logics of Knowledge, Actions, and Time in Models, in Sistemnaya informatika (System Informatics), Novosibirsk: Sib. Otd. RAN, 2006, issue 10, pp. 114–173.

    Google Scholar 

  35. Shilov, N.V., Garanina, N.O., and Choe, K.-M., Update and Abstraction in Model Checking of Knowledge and Branching Time, Fund. Inform., 2006, vol. 72, no. 1–3, pp. 347–361.

    MATH  MathSciNet  Google Scholar 

  36. Emerson, E.A. and Lei, C.L., Efficient Model Checking in Fragments of the μ-Calculus, Proc. of the IEEE Symposium on Logic in Computer Science, 1986.

Download references

Author information

Authors and Affiliations

  1. Keldysh Institute of Applied Mathematics, Russian Academy of Sciences, Miusskaya pl. 1, Moscow, 125047, Russia

    M. K. Valiev

  2. Tver State University, ul. Zhelyabova 3, Tver, 170013, Russia

    M. I. Dekhtyar

  3. University of Nantes, 2 rue de la Houssiniere, BP 92208, 44322, Nantes Cedex 3, France

    A. Ya. Dikovsky

Authors
  1. M. K. Valiev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. I. Dekhtyar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Ya. Dikovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. K. Valiev.

Additional information

Original Russian Text © M.K. Valiev, M.I. Dekhtyar, A.Ya. Dikovsky, 2009, published in Programmirovanie, 2009, Vol. 35, No. 5.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Valiev, M.K., Dekhtyar, M.I. & Dikovsky, A.Y. Systems of agents controlled by logical programs: Complexity of verification. Program Comput Soft 35, 266–281 (2009). https://doi.org/10.1134/S036176880905003X

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S036176880905003X

Keywords

Search

Navigation