Advertisement

Dynamic Multi-Agent Systems: Conceptual Framework, Automata-Based Modelling and Verification

  • Rodica Condurache
  • Riccardo De MasellisEmail author
  • Valentin Goranko
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11873)

Abstract

We study dynamic multi-agent systems (dmass). These are multi-agent systems with explicitly dynamic features, where agents can join and leave the system during the evolution. We propose a general conceptual framework for modelling such dmass and argue that it can adequately capture a variety of important and representative cases. We then present a concrete modelling framework for a large class of dmass, composed in a modular way from agents specified by means of automata-based representations. We develop generic algorithms implementing the dynamic behaviour, namely addition and removal of agents in such systems. Lastly, we state and discuss several formal verification tasks that are specific for dmass and propose general algorithmic solutions for the class of automata representable dmass.

Notes

Acknowledgements

The work of Valentin Goranko and Riccardo De Masellis was supported by a research grant 2015-04388 of the Swedish Research Council.

We thank the reviewers for some helpful comments and suggestions.

References

  1. 1.
    Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53–64 (2016)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bulling, N., Goranko, V., Jamroga, W.: Logics for reasoning about strategic abilities in multi-player games. In: Models of Strategic Reasoning: Logics, Games, and Communities, pp. 93–136 (2015)Google Scholar
  3. 3.
    De Giacomo, G., Vardi, M., Felli, P., Alechina, N., Logan, B.: Synthesis of orchestrations of transducers for manufacturing. In: Proceedings of the AAAI 2018, pp. 6161–6168 (2018)Google Scholar
  4. 4.
    De Masellis, R., Goranko, V.: Logic-based specification and verification of homogeneous dynamic multi-agent systems. arXiv:1905.00810 [cs.LO] (2019)
  5. 5.
    Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Model checking population protocols. In: 36th IARCS Annual Conference on FSTTCS, pp. 27:1–27:14 (2016)Google Scholar
  6. 6.
    Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  7. 7.
    Fisher, J., Henzinger, T.A., Nickovic, D., Piterman, N., Singh, A.V., Vardi, M.Y.: Dynamic reactive modules. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 404–418. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-23217-6_27CrossRefGoogle Scholar
  8. 8.
    Fitting, M., Thalmann, L., Voronkov, A.: Term-modal logics. Stud. Logica. 69(1), 133–169 (2001)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Jamroga, W., Ågotnes, T.: Modular interpreted systems. In: Proceedings of AAMAS, pp. 131:1–131:8. ACM (2007)Google Scholar
  10. 10.
    Kouvaros, P., Lomuscio, A.: Parameterised verification for multi-agent systems. Artif. Intell. 234, 152–189 (2016)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kouvaros, P., Lomuscio, A., Pirovano, E., Punchihewa, H.: Formal verification of open multi-agent systems. In: Proceedings of AAMAS 2019, pp. 179–187 (2019)Google Scholar
  12. 12.
    Raskin, J., Samuelides, M., Van Begin, L.: Games for counting abstractions. Electr. Notes Theor. Comput. Sci. 128(6), 69–85 (2005)CrossRefGoogle Scholar
  13. 13.
    Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM 32(3), 733–749 (1985)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Rodica Condurache
    • 1
  • Riccardo De Masellis
    • 2
    Email author
  • Valentin Goranko
    • 2
    • 3
  1. 1.A. I. Cuza University of IasiIaşiRomania
  2. 2.Stockholm UniversityStockholmSweden
  3. 3.University of Johannesburg (visiting professorship)JohannesburgSouth Africa

Personalised recommendations