Michal Kanski, A. Niewiadomski, M. Kacprzak, W. Penczek, Wojciech Nabialek
{"title":"Unbounded Model Checking for ATL","authors":"Michal Kanski, A. Niewiadomski, M. Kacprzak, W. Penczek, Wojciech Nabialek","doi":"10.34739/si.2021.25.01","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":30071,"journal":{"name":"Studia Universitatis BabesBolyai Series Informatica","volume":"36 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Universitatis BabesBolyai Series Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34739/si.2021.25.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
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.