Kurz gefasst
Fachartikel in der Zeitschrift Studia Informatica, 2021. Verfasst von Michał Kański und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
In this paper, we deal with verification of multi-agent systems represented as concurrent game structures. To express properties to be verified, we use Alternating-Time Temporal Logic (ATL) formulas. We provide an implementation of symbolic model checking for ATL and preliminary, but encouraging experimental results.
Zitieren
APA
Kański, M., Niewiadomski, A., Kacprzak, M., Penczek, W., & Nabiałek, W. (2021). Unbounded Model Checking for ATL. Studia Informatica. https://doi.org/10.34739/si.2021.25.01
Vancouver
Kański M, Niewiadomski A, Kacprzak M, Penczek W, Nabiałek W. Unbounded Model Checking for ATL. Studia Informatica. 2021. doi:10.34739/si.2021.25.01
BibTeX
@article{Kaski2021,
author = {Kański, Michał and Niewiadomski, Artur and Kacprzak, Magdalena and Penczek, Wojciech and Nabiałek, Wojciech},
title = {Unbounded Model Checking for ATL},
journal = {Studia Informatica},
year = {2021},
doi = {10.34739/si.2021.25.01}
}
EUVIMED