Article

Specification and verification of multi-agent systems

Authors:

Wojciech Jamroga,

Wojciech PenczekAuthors Info & Claims

ESSLLI'10: Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation

Pages 210 - 263

https://doi.org/10.1007/978-3-642-31485-8_6

Published: 01 August 2010 Publication History

Abstract

Overview. Multi agent systems (MAS) provide an important framework for formalizing various problems in computer science, artificial intelligence, game theory, social choice theory, etc. Modal logics are amongst the most suitable and versatile logical formalisms for specification and verification of computational systems. Here, we present an overview of some important developments in the area. We introduce modal logics used for specification of temporal, epistemic, and strategic properties of systems; then, we present some model checking algorithms, and discuss the computational complexity of the model checking problem. Finally, we consider symbolic (compact) representations of systems based on Binary Decision Diagrams (BDD) and propositional logic formulas, and show how the representations change the algorithmic side of model checking. We also discuss other techniques that help to reduce the complexity and make the verification feasible even for large systems.

References

[1]

Agotnes, T.: Action and knowledge in alternating-time temporal logic. Synthese 149(2), 377-409 (2006); Section on Knowledge, Rationality and Action.

[2]

Agotnes, T., Goranko, V., Jamroga, W.: Alternating-time temporal logics with irrevocable strategies. In: Samet, D. (ed.) Proceedings of TARK XI, pp. 15-24 (2007).

Digital Library

[3]

Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pp. 100-109. IEEE Computer Society Press (1997).

Digital Library

[4]

Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time Temporal Logic. Journal of the ACM 49, 672-713 (2002).

Digital Library

[5]

Beeri, C.: On the membership problem for functional and multivalued dependencies in relational databases. ACM Transactions on Database Systems 5(3), 241-259 (1980).

Digital Library

[6]

Biere, A., Cimatti, A., Clarke, E., Strichman, O., Zhu, Y.: Bounded model checking. In: Highly Dependable Software. Advances in Computers, vol. 58. Academic Press (2003) (pre-print).

[7]

Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press (2001).

Digital Library

[8]

Bulling, N.: Model checking coalition logic on implicit models is Δ₃-complete. Technical Report IfI-10-02, Clausthal University of Technology (2010).

[9]

Bulling, N., Dix, J., Jamroga, W.: Model checking logics of strategic ability: Complexity. In: Dastani, M., Hindriks, K., Meyer, J.-J. (eds.) Specification and Verification of Multi-Agent Systems, pp. 125-159. Springer (2010).

[10]

Bulling, N., Jamroga, W.: What agents can probably enforce. Fundamenta Informaticae 93(1-3), 81-96 (2009).

Digital Library

[11]

Bulling, N., Jamroga, W.: Alternating epistemic mu-calculus. In: Proceedings of IJCAI 2011, pp. 109-114 (2011).

Digital Library

[12]

Bulling, N., Jamroga, W., Dix, J.: Reasoning about temporal properties of rational play. Annals of Mathematics and Artificial Intelligence 53(1-4), 51-114 (2008).

Digital Library

[13]

Clarke, E., Emerson, E.A., Sistla, A.P.: Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems 8(2), 244-263 (1986).

Digital Library

[14]

Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8(2), 244-263 (1986).

Digital Library

[15]

Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press (1999).

Digital Library

[16]

Cohen, P.R., Levesque, H.J.: Intention is choice with commitment. Artificial Intelligence 42, 213-261 (1990).

Digital Library

[17]

Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5(7), 394-397 (1962).

Digital Library

[18]

Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201-215 (1960).

Digital Library

[19]

de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. Theoretical Computer Science 345, 139- 170 (2005).

Digital Library

[20]

Dembinski, P., Janowska, A., Janowski, P., Penczek, W., Półrola, A., Szreter, M., Wozna, B., Zbrzezny, A.: Verics: A Tool for Verifying Timed Automata and Estelle Specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 278-283. Springer, Heidelberg (2003).

Digital Library

[21]

Dima, C., Tiplea, F.L.: Model-checking atl under imperfect information and perfect recall semantics is undecidable. CoRR, abs/1102.4225 (2011).

[22]

Doyen, L., Raskin, J.-F.: Games with imperfect information: Theory and algorithms. Lecture Notes in Game Theory for Computer Scientists, pp. 185-212. Cambridge University Press (2011).

[23]

Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 995-1072. Elsevier Science Publishers (1990).

Digital Library

[24]

Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional mu-calculus. In: Proc. of the 1st Symp. on Logic in Computer Science (LICS 1986), pp. 267-278. IEEE Computer Society (1986).

[25]

Emerson, E.A., Lei, C.-L.: Modalities for model checking: Branching time logic strikes back. Science of Computer Programming 8(3), 275-306 (1987).

Digital Library

[26]

Emerson, E.A., Sistla, A.P.: Deciding branching time logic. In: STOC 1984: Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pp. 14-24. ACM, New York (1984).

Digital Library

[27]

Emerson, E.A., Halpern, J.Y.: "sometimes" and "not never" revisited: On branching versus linear time temporal logic. Journal of the ACM 33(1), 151-178 (1986).

Digital Library

[28]

Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press (1995).

Digital Library

[29]

Fisher, M.: Temporal Logics. Kluwer (2006).

[30]

Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer (1990).

Digital Library

[31]

Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory 17, 13-27 (1984).

[32]

Goranko, V., Jamroga, W.: State and path effectivity models for logics of multiplayer games. In: Proceedings of AAMAS (to appear, 2012).

Digital Library

[33]

Goranko, V., Jamroga, W., Turrini, P.: Strategic games and truly playable effectivity functions. In: Proceedings of AAMAS 2011, pp. 727-734 (2011).

Digital Library

[34]

Goranko, V., van Drimmelen, G.: Complete axiomatization and decidability of alternating-time temporal logic. Theoretical Computer Science 353(1), 93-117 (2006).

Digital Library

[35]

Guelev, D.P., Dima, C., Enea, C.: An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. Journal of Applied Non-Classical Logics 21(1), 93-131 (2011).

[36]

Halpern, J.Y.: Reasoning about knowledge: a survey. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) The Handbook of Logic in Artificial Intelligence and Logic Programming, vol. IV, pp. 1-34. Oxford University Press (1995).

Digital Library

[37]

Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000).

Digital Library

[38]

Harrenstein, B.P., van der Hoek, W., Meyer, J.-J., Witteveen, C.: A modal characterization of Nash equilibrium. Fundamenta Informaticae 57(2-4), 281-321 (2003).

Digital Library

[39]

Harrenstein, P., van der Hoek, W., Meijer, J.-J., Witteveen, C.: Subgame-perfect Nash equilibria in dynamic logic. In: Pauly, M., Baltag, A. (eds.) Proceedings of the ILLC Workshop on Logic and Games, vol. 25, pp. 29-30. University of Amsterdam (2002); Tech. Report PP-1999-25.

[40]

Hawke, P.: Coordination, almost perfect information and strategic ability. In: Proceedings of LAMAS (2010).

[41]

van der Hoek, W., Wooldridge, M.: Model Checking Knowledge and Time. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 95-111. Springer, Heidelberg (2002).

Digital Library

[42]

Huang, X., Su, K., Zhang, C.: Probabilistic alternating-time temporal logic of incomplete information and synchronous perfect recall. In: Proceedings of AAAI 2012 (to appear, 2012).

[43]

Huth, M., Ryan, M.: Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press (2004).

Digital Library

[44]

Immerman, N.: Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences 22(3), 384-406 (1981).

[45]

Jamroga, W.: Some remarks on alternating temporal epistemic logic. In: Dunin-Keplicz, B., Verbrugge, R. (eds.) Proceedings of Formal Approaches to Multi-Agent Systems (FAMAS 2003), pp. 133-140 (2003).

[46]

Jamroga, W.: A Temporal Logic for Stochastic Multi-Agent Systems. In: Bui, T.D., Ho, T.V., Ha, Q.T. (eds.) PRIMA 2008. LNCS (LNAI), vol. 5357, pp. 239- 250. Springer, Heidelberg (2008).

Digital Library

[47]

Jamroga, W.: Easy Yet Hard: Model Checking Strategies of Agents. In: Fisher, M., Sadri, F., Thielscher, M. (eds.) CLIMA IX. LNCS, vol. 5405, pp. 1-12. Springer, Heidelberg (2009).

Digital Library

[48]

Jamroga, W., Agotnes, T.: Modular interpreted systems: A preliminary report. Technical Report IfI-06-15, Clausthal University of Technology (2006).

[49]

Jamroga, W., Agotnes, T.: Constructive knowledge: What agents can achieve under incomplete information. Journal of Applied Non-Classical Logics 17(4), 423-475 (2007).

[50]

Jamroga, W., Agotnes, T.: Modular interpreted systems. In: Proceedings of AAMAS 2007, pp. 892-899 (2007).

Digital Library

[51]

Jamroga, W., Dix, J.: Do Agents Make Model Checking Explode (Computationally)? In: Pechouček, M., Petta, P., Varga, L.Z. (eds.) CEEMAS 2005. LNCS (LNAI), vol. 3690, pp. 398-407. Springer, Heidelberg (2005).

Digital Library

[52]

Jamroga, W., Dix, J.: Model checking ATL_ir is indeed Δ₂ ^P-complete. In: Proceedings of EUMAS 2006 (2006).

[53]

Jamroga, W., Dix, J.: Model checking abilities of agents: A closer look. Theory of Computing Systems 42(3), 366-410 (2008).

Digital Library

[54]

Jamroga, W., van der Hoek, W.: Agents that know how to play. Fundamenta Informaticae 63(2-3), 185-219 (2004).

Digital Library

[55]

Jonker, G.: Feasible strategies in Alternating-time Temporal Epistemic Logic. Master thesis, University of Utrecht (2003).

[56]

Kacprzak, M., Lomuscio, A., Łasica, T., Penczek, W., Szreter, M.: Verifying Multiagent Systems via Unbounded Model Checking. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A. (eds.) FAABS 2004. LNCS (LNAI), vol. 3228, pp. 189-212. Springer, Heidelberg (2004).

Digital Library

[57]

Kacprzak, M., Lomuscio, A., Niewiadomski, A., Penczek, W., Raimondi, F., Szreter, M.: Comparing BDD and SAT based techniques for model checking Chaum's dining cryptographers protocol. Fundamenta Informaticae 72(1-2), 215- 234 (2006).

Digital Library

[58]

Kacprzak, M., Lomuscio, A., Penczek, W.: From bounded to unbounded model checking for temporal epistemic logic. Fundamenta Informaticae 63(2-3), 221-240 (2004).

Digital Library

[59]

Kacprzak, M., Lomuscio, A., Penczek, W.: From bounded to unbounded model checking for temporal epistemic logic. Fundam. Inform. 63(2-3), 221-240 (2004).

Digital Library

[60]

Kacprzak, M., Nabialek, W., Niewiadomski, A., Penczek, W., Pólrola, A., Szreter, M., Wozna, B., Zbrzezny, A.: VerICS 2007 - a model checker for knowledge and real-time. Fundamenta Informaticae 85(1-4), 313-328 (2008).

Digital Library

[61]

Kacprzak, M., Penczek, W.: Fully symbolic unbounded model checking for alternating-time temporal logic. Autonomous Agents and Multi-Agent Systems 11(1), 69-89 (2005).

Digital Library

[62]

Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333-354 (1983).

[63]

Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM 47(2), 312-360 (2000).

Digital Library

[64]

Laroussinie, F., Markey, N., Oreiby, G.: On the expressiveness and complexity of ATL. Logical Methods in Computer Science 4, 7 (2008).

[65]

Laroussinie, F., Markey, N., Schnoebelen, P.: Model Checking CTL+ and FCTL is Hard. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 318-331. Springer, Heidelberg (2001).

Digital Library

[66]

Leyton-Brown, K., Shoham, Y.: Essentials of Game Theory: A Concise, Multidisciplinary Introduction. Morgan & Claypool (2008).

Digital Library

[67]

Lichtenstein, O., Pnueli, A.: Checking that finite state concurrent programs satisfy their linear specification. In: POPL 1985: Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 97-107. ACM, New York (1985).

Digital Library

[68]

Lomuscio, A., Penczek, W.: Logic column 19: Symbolic model checking for temporal-epistemic logics. CoRR, abs/0709.0446 (2007).

[69]

Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: A Model Checker for the Verification of Multi-Agent Systems. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 682-688. Springer, Heidelberg (2009).

Digital Library

[70]

Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conference (DAC 2001), pp. 530-535 (June 2001).

Digital Library

[71]

Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press (1994).

[72]

Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1994).

[73]

Pauly, M.: Logic for Social Software. PhD thesis, University of Amsterdam (2001).

[74]

Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. In: Proc. of the 2nd Int. Conf. on Autonomous Agents and Multi-Agent Systems (AAMAS 2003), pp. 209-216. ACM (2003).

Digital Library

[75]

Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae 55(2), 167-185 (2003).

Digital Library

[76]

Penczek, W., Polrola, A.: Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach. SCI, vol. 20. Springer (2006).

Digital Library

[77]

Peterson, G., Reif, J.: Multiple-person alternation. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS), pp. 348-363. IEEE Computer Society Press (1979).

Digital Library

[78]

Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer noncooperative games of incomplete information. Computers and Mathematics with Applications 41(7), 957-992.

[79]

Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL 1989: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 179-190. ACM, New York (1989).

Digital Library

[80]

Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of the 31th Annual Symposium on Foundations of Computer Science (FOCS), pp. 746-757. IEEE Computer Society Press (1990).

Digital Library

[81]

Raimondi, F.: Model Checking Multi-Agent Systems. PhD thesis, University College London (2006).

[82]

Raimondi, F., Lomuscio, A.: Automatic verification of deontic interpreted systems by model checking via OBDD's. In: de Mántaras, R.L., Saitta, L. (eds.) Proceedings of ECAI, pp. 53-57 (2004).

[83]

Raimondi, F., Lomuscio, A.: Verification of multiagent systems via ordered binary decision diagrams: An algorithm and its implementation. In: AAMAS, pp. 630- 637 (2004).

Digital Library

[84]

Rao, A.S., Georgeff, M.P.: Modeling rational agents within a BDI-architecture. In: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pp. 473-484 (1991).

Digital Library

[85]

Rosner, R.: Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science (1992).

[86]

Schnoebelen, P.: The complexity of temporal model checking. In: Advances in Modal Logics, Proceedings of AiML 2002. World Scientific (2003).

[87]

Schnoor, H.: Strategic planning for probabilistic games with incomplete information. In: Proceedings of AAMAS 2010, pp. 1057-1064 (2010).

Digital Library

[88]

Schobbens, P.Y.: Alternating-time logic with imperfect recall. Electronic Notes in Theoretical Computer Science 85(2), 82-93 (2004).

[89]

Sheeran, M., Singh, S., Stålmarck, G.: Checking Safety Properties Using Induction and a SAT-Solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 108-125. Springer, Heidelberg (2000).

Digital Library

[90]

Shilov, N.V., Garanina, N.O., Choe, K.-M.: Update and abstraction in model checking of knowledge and branching time. Fundamenta Informaticae 72(1-3), 347-361 (2006).

Digital Library

[91]

Shilov, N.V., Garanina, N.O., Kalinina, N.A.: Model checking knowledge, actions and fixpoints. In: Proceedings of CS&P 2004, pp. 351-357 (2004).

[92]

Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. Journal of ACM 32(3), 733-749 (1985).

Digital Library

[93]

Stirling, C.: Modal and Temporal Properties of Processes. Springer (2001).

Digital Library

[94]

Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285-309 (1955).

[95]

van der Hoek, W., Jamroga, W., Wooldridge, M.: A logic for strategic reasoning. In: Proceedings of AAMAS 2005, pp. 157-164 (2005).

Digital Library

[96]

van der Hoek, W., Lomuscio, A., Wooldridge, M.: On the complexity of practical ATL model checking. In: Stone, P., Weiss, G. (eds.) Proceedings of AAMAS 2006, pp. 201-208 (2006).

Digital Library

[97]

van der Hoek, W., Verbrugge, R.: Epistemic logic: A survey. Game Theory and Applications 8, 53-94 (2002).

[98]

van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: Castelfranchi, C., Johnson, W.L. (eds.) Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2002), pp. 1167-1174. ACM Press, New York (2002).

Digital Library

[99]

van der Hoek, W., Wooldridge, M.: Cooperation, knowledge and time: Alternating-time Temporal Epistemic Logic and its applications. Studia Logica 75(1), 125-157 (2003).

[100]

van der Meyden, R., Shilov, N.V.: Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract). In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432-445. Springer, Heidelberg (1999).

Digital Library

[101]

van Otterloo, S., Jonker, G.: On Epistemic Temporal Strategic Logic. Electronic Notes in Theoretical Computer Science XX, 35-45 (2004); Proceedings of LCMAS 2004.

Digital Library

[102]

Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the First Annual IEEE Symposium on Logic in Computer Science (LICS 1986), pp. 332-344. IEEE Computer Society Press (1986).

[103]

Walther, D., van der Hoek, W., Wooldridge, M.: Alternating-time temporal logic with explicit strategies. In: Samet, D. (ed.) Proceedings TARK XI, pp. 269-278. Presses Universitaires de Louvain (2007).

Digital Library

[104]

Weiss, G. (ed.): Multiagent Systems. A Modern Approach to Distributed Artificial Intelligence. MIT Press, Cambridge (1999).

Digital Library

[105]

Wooldridge, M.: An Introduction to Multi Agent Systems. John Wiley & Sons (2002).

Digital Library

Cited By

Della Monica DMurano AAndre EKoenig SDastani MSukthankar G(2018)Parity-energy ATL for Qualitative and Quantitative Reasoning in MASProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237915(1441-1449)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237915
Bakar NSelamat A(2018)Agent systems verificationApplied Intelligence10.1007/s10489-017-1112-z48:5(1251-1274)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s10489-017-1112-z
André ÉPetrucci LJamroga WKnapik MPenczek WLarson KWinikoff MDas SDurfee E(2017)Timed ATLProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091329(1460-1462)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091329
Show More Cited By

Specification and verification of multi-agent systems
1. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Formal methods
2. Theory of computation
  1. Logic

Recommendations

Specification and Verification of Multi-agent Systems
Specification and automated verification of concurrent software systems
Verification of Multi-Agent Systems via Predicate Abstraction against ATLK Specifications
AAMAS '16: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems

We present a predicate abstraction technique for the verification of multi-agent systems against specifications defined in the epistemic logic ATLK, interpreted on a three-valued semantics. We reduce an infinite-state multi-agent program to a finite ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESSLLI'10: Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation

August 2010

264 pages

ISBN:9783642314841

Editors:
Nick Bezhanishvili
Department of Computing, Imperial College London, 180 Queen's Gate, London, UK
,
Valentin Goranko
Department of Informatics and Mathematical Modelling, Technical University of Denmark, Asmussens Alle, Bld. 305, 2800 Kgs., Lyngby,, Denmark

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 August 2010

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Della Monica DMurano AAndre EKoenig SDastani MSukthankar G(2018)Parity-energy ATL for Qualitative and Quantitative Reasoning in MASProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237915(1441-1449)Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.5555/3237383.3237915
Bakar NSelamat A(2018)Agent systems verificationApplied Intelligence10.1007/s10489-017-1112-z48:5(1251-1274)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.1007/s10489-017-1112-z
André ÉPetrucci LJamroga WKnapik MPenczek WLarson KWinikoff MDas SDurfee E(2017)Timed ATLProceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems10.5555/3091125.3091329(1460-1462)Online publication date: 8-May-2017
https://dl.acm.org/doi/10.5555/3091125.3091329
Yadav NThangarajah J(2016)Checking the conformance of requirements in agent designs using ATLProceedings of the Twenty-second European Conference on Artificial Intelligence10.3233/978-1-61499-672-9-243(243-251)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.3233/978-1-61499-672-9-243
Chen QSu KSattar ALuo XChen A(2016)A first-order coalition logic for BDI-agentsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-015-4591-210:2(233-245)Online publication date: 1-Apr-2016
https://dl.acm.org/doi/10.1007/s11704-015-4591-2
Mogavero FMurano ASauro L(2013)On the Boundary of Behavioral StrategiesProceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS.2013.32(263-272)Online publication date: 25-Jun-2013
https://dl.acm.org/doi/10.1109/LICS.2013.32

View Options

View options

Figures

Tables

Media

View Table of Conten