pith. sign in
Pith Number

pith:MZHZ2TES

pith:2026:MZHZ2TESBZYHQG7PKQQGXBCOB6
not attested not anchored not stored refs resolved

Security-Aware Planning and Control of Multi-Agent Systems with LTL Tasks

Dimos V. Dimarogonas, Georgios Mitsos, Siyuan Liu

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.

arxiv:2605.13134 v1 · 2026-05-13 · eess.SY · cs.SY

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MZHZ2TESBZYHQG7PKQQGXBCOB6}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

22 extracted · 22 resolved · 0 Pith anchors

[1] Sreenath, K., and Tabuada, P. (2019). Control barrier functions: theory and applications. InProc. 18th IEEE Eur. Conf. Control, 3420–3431 2019
[2] Baier, C. and Katoen, J. (2008).Principles of Model Checking. MIT Press 2008
[3] 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 2009
[4] Fukuda, K. (2025). cddlib: An efficient implementation of the double description method 2025
[5] Gastin, P. and Oddoux, D. (2020).LTL2BA(version 1.3) 2020
Receipt and verification
First computed 2026-05-18T03:08:57.638833Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431

Aliases

arxiv: 2605.13134 · arxiv_version: 2605.13134v1 · doi: 10.48550/arxiv.2605.13134 · pith_short_12: MZHZ2TESBZYH · pith_short_16: MZHZ2TESBZYHQG7P · pith_short_8: MZHZ2TES
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MZHZ2TESBZYHQG7PKQQGXBCOB6 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 664f9d4c920e70781bef54206b844e0fb8a960f27e5d32ba5f8b80247f40c431
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "1b1bd6ce4a2caf258f3badb86f3f6ee80f6e472fc80da4b188f038e623baf09d",
    "cross_cats_sorted": [
      "cs.SY"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "eess.SY",
    "submitted_at": "2026-05-13T08:03:04Z",
    "title_canon_sha256": "9b9dd381b38020d06428506ddd902fce9d1786cbcdc88e5d8cc8fb5d188734e5"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13134",
    "kind": "arxiv",
    "version": 1
  }
}