{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T07:45:18Z","timestamp":1770709518299,"version":"3.49.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Hyperproperties are system properties that relate multiple computation paths\nin a system and are commonly used to, e.g., define information-flow policies.\nIn this paper, we study a novel class of hyperproperties that allow reasoning\nabout strategic abilities in multi-agent systems. We introduce HyperATL*, an\nextension of computation tree logic with path variables and strategy\nquantifiers. Our logic supports quantification over paths in a system - as is\npossible in hyperlogics such as HyperCTL* - but resolves the paths based on the\nstrategic choices of a coalition of agents. This allows us to capture many\npreviously studied (strategic) security notions in a unifying hyperlogic.\nMoreover, we show that HyperATL* is particularly useful for specifying\nasynchronous hyperproperties, i.e., hyperproperties where the execution speed\non the different computation paths depends on the choices of a scheduler. We\nshow that finite-state model checking of HyperATL* is decidable and present a\nmodel checking algorithm based on alternating automata. We establish that our\nalgorithm is asymptotically optimal by proving matching lower bounds. We have\nimplemented a prototype model checker for a fragment of HyperATL* that can\ncheck various security properties in small finite-state systems.<\/jats:p>","DOI":"10.46298\/lmcs-19(2:13)2023","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T08:10:23Z","timestamp":1685520623000},"source":"Crossref","is-referenced-by-count":10,"title":["HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems"],"prefix":"10.46298","volume":"Volume 19, Issue 2","author":[{"given":"Raven","family":"Beutner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,5,31]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/11405\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/11405\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:46Z","timestamp":1687292446000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/9209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(2:13)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2203.07283v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2203.07283v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2203.07283","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2203.07283","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"article-number":"9209"}}