{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T15:18:08Z","timestamp":1773155888635,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"CNRS"},{"name":"PAN"},{"name":"MoSART"},{"name":"NCBR Poland"},{"name":"FNR Luxembourg"},{"name":"PolLux\/FNR-CORE"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tr.2024.3354459","type":"journal-article","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T18:33:28Z","timestamp":1706726008000},"page":"861-875","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Scheduling of Agents in ADTrees: Specialized Algorithm and Declarative Models"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3019-4902","authenticated-orcid":false,"given":"Jaime","family":"Arias","sequence":"first","affiliation":[{"name":"LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, Villetaneuse, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7264-7773","authenticated-orcid":false,"given":"Carlos","family":"Olarte","sequence":"additional","affiliation":[{"name":"LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, Villetaneuse, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3154-5268","authenticated-orcid":false,"given":"Laure","family":"Petrucci","sequence":"additional","affiliation":[{"name":"LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, Villetaneuse, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5141-3276","authenticated-orcid":false,"given":"\u0141ukasz","family":"Ma\u015bko","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6477-4863","authenticated-orcid":false,"given":"Wojciech","family":"Penczek","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4393-3447","authenticated-orcid":false,"given":"Teofil","family":"Sidoruk","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"An Introduction to Multiagent Systems","author":"Wooldridge","year":"2002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19751-2_6"},{"key":"ref3","first-page":"95","article-title":"Pareto Efficient Solutions of ADTrees","volume-title":"Proc. POST","author":"Aslanyan","year":"2015"},{"key":"ref4","first-page":"156","article-title":"Towards partial order reductions for strategic ability","volume-title":"Proc. Int. Conf. Auton. Agents Multi-agent Syst.","author":"Jamroga","year":"2018"},{"key":"ref5","first-page":"3","article-title":"Hackers vs. security: ADTrees as asynchronous multi-agent systems","volume-title":"Proc. Int. Conf. Formal Eng. Methods","author":"Arias","year":"2020"},{"key":"ref6","first-page":"71","article-title":"Squeezing state spaces of ADTrees","volume-title":"Proc. IEEE 24th Int. Conf. Eng. Complex Comput. Syst.","author":"Petrucci","year":"2019"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90182-F"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2012.06.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2019.100497"},{"key":"ref10","volume-title":"All About MaudeA High-Performance Logical Framework","author":"Clavel","year":"2007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exs029"},{"key":"ref12","first-page":"35","article-title":"Modelling ADTrees using timed automata","volume-title":"Proc. FORMATS","author":"Gadyatskaya","year":"2016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24249-1_25"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2014.12.014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2016.15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2014.07.001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3331524"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/csf49147.2020.00035"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/361604.361619"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.841"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0208031"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1986.6313018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1005"},{"key":"ref25","first-page":"749","article-title":"Softgoal-based plan selection in model-driven BDI agents","volume-title":"Proc. Int. Conf. Auton. Agents Multi-agent Syst.","author":"Nunes","year":"2014"},{"key":"ref26","first-page":"285","article-title":"Intention-aware multiagent scheduling","volume-title":"Proc. Int. Conf. Auton. Agents Multi-Agent Syst.","author":"Dann","year":"2020"},{"key":"ref27","first-page":"105","article-title":"SPToolEquivalence checker for SAND attack trees","volume-title":"Proc. Int. Conf. Risks Secur. Internet Syst.","author":"Kordy","year":"2016"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15465-3_5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2017-1531"},{"key":"ref30","first-page":"1749","article-title":"ADT2AMAS: Managing agents in attack-defence scenarios","volume-title":"Proc. Int. Conf. Auton. Agents Multi-Agent Syst.","author":"Arias","year":"2021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICECCS54210.2022.00009"},{"key":"ref32","article-title":"ADT2AMAS: Tool for managing agents in attack-defense scenarios"},{"key":"ref33","article-title":"ADT2MAUDE: Tool for managing agents in attack-defense scenarios"},{"key":"ref34","first-page":"227","article-title":"A rewriting semantics for Maude strategies","volume-title":"Proc. 7th Int. Workshop Rewriting Log. Appl.","author":"Mart-Oliet","year":"2008"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11612"},{"key":"ref36","first-page":"382","article-title":"Strategic (Timed) CTL","volume-title":"Proc. Int. Conf. Auton. Agents Multi-Agent Syst","author":"Arias","year":"2023"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2016.10.001"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/10547161\/10418093.pdf?arnumber=10418093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T01:02:07Z","timestamp":1733878927000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10418093\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":37,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tr.2024.3354459","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}