{"paper":{"title":"Security-Aware Planning and Control of Multi-Agent Systems with LTL Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Dimos V. Dimarogonas, Georgios Mitsos, Siyuan Liu","submitted_at":"2026-05-13T08:03:04Z","abstract_excerpt":"This paper presents a secure-by-construction planning and control framework for multi-agent systems subject to linear temporal logic (LTL) specifications. The framework protects sensitive information from a passive intruder with partial observations of the agents' motion. Security in multi-agent coordination is captured by two notions that prevent the intruder from inferring whether a secret task has been executed and from identifying the agent responsible for its execution. The proposed framework incorporates the security constraints directly into the LTL synthesis procedure by constructing a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"50a0447e8173e8172c52c174296757e03e73e69dd7303876d4e74304f76da411"},"source":{"id":"2605.13134","kind":"arxiv","version":1},"verdict":{"id":"fc71f3e5-77c9-4787-844d-bb1800f19644","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:53:42.047248Z","strongest_claim":"This synthesis procedure provides formal guarantees that the resulting behavior of the multi-agent system satisfies both the global LTL specification and the security constraints.","one_line_summary":"A secure-by-construction framework builds a finite transition system that removes paths violating two security notions, then applies standard LTL synthesis to produce plans satisfying both task specifications and intruder-resistance constraints.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that the two security notions can be enforced exactly by removing violating paths from a finite transition system abstraction of the agents' continuous dynamics, and that the intruder’s partial observations are known in advance.","pith_extraction_headline":"A synthesis procedure builds secure transition system abstractions for multi-agent LTL tasks by removing paths that would let a partial observer infer secret executions or responsible agents."},"references":{"count":22,"sample":[{"doi":"","year":2019,"title":"Sreenath, K., and Tabuada, P. (2019). Control barrier functions: theory and applications. InProc. 18th IEEE Eur. Conf. Control, 3420–3431","work_id":"1e1cdefb-c1af-4535-b95e-eba552531072","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Baier, C. and Katoen, J. (2008).Principles of Model Checking. MIT Press","work_id":"b5abe755-1474-4792-abf8-bd22e6ce1da8","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Fainekos, G.E., Girard, A., Kress-Gazit, H., and Pappas, G.J. (2009). Temporal logic motion planning for dy- namic robots.Automatica, 45(2), 343–352","work_id":"ccfbd32f-3b9a-47cf-80e5-3504095d01a6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Fukuda, K. (2025). cddlib: An efficient implementation of the double description method","work_id":"aa33f270-7518-4673-915f-91cbca09eabe","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Gastin, P. and Oddoux, D. (2020).LTL2BA(version 1.3)","work_id":"fd5a9124-0e12-4a31-8ea2-edfc4e6d4a6d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":22,"snapshot_sha256":"9c8641c65eebfd342d08aada4f14804a229b3b734544d4a143515c4073478c4a","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}