arXiv：cs.AI· Hanzhang Jia, Liheng Zeng, Hao Cheng, Yi Gao, Bo Ma, Guolong Xu·· 16 小时前
插件式智能体的可逆性保证如何跨进程延续：Logos 跨进程插件智能体
Composition without a Host: Carrying the Spatiotemporal-Composability Guarantee of Plugin-Based Agents across Processes
AI 导读
论文将插件式智能体的时空可组合性演算从单进程限制放宽到组件的任意进程分配，给出四个充分条件并用 Theorem 1 证明可逆性保证跨进程成立。基于该定理构建的 Logos 采用 ROS 式的对等进程与名字路由形式，插件即进程，恢复所需的会话状态存放在无归属的追加式记录中。
正文
Abstract:Plugin-based agents assemble capabilities at runtime, and the spatiotemporal-composability calculus proves a reversibility guarantee for this assembly. However, the guarantee is carried by a single process, which confines all components, sessions, and recovery records to one failure domain, where a fault spreads past the plugin boundary, and process death interrupts every session the process hosts. Resting only on the hypotheses the calculus already states and the stateless interface of the model call, this paper relaxes the single-process restriction of the calculus to an arbitrary assignment of components and records to processes, gives four sufficient conditions, and proves with Theorem 1, derived from the four lemmas, that the reversibility guarantee holds across processes when these conditions are met. Based on Theorem 1, this paper constructs Logos, a cross-process plugin-based agent in the peer-process and name-routed form of ROS, where a plugin is a process, the router holds only a rebuildable routing table, and the session state needed for recovery lives in an append-only transcript owned by no process. Under one fault on two hundred benchmark tasks across three configurations, the single-process reference lost every session and scored 1.5 percent on the official validator, the MCP configuration kept its sessions while spending 1099 calls on a dead endpoint, and Logos kept every session alive, wasted zero calls, and succeeded on 120 tasks against 102 for both configurations combined. At the mechanism level, eighty sessions terminated at four points of the tool-call cycle all resumed with no repeated action, 3,500 concurrent calls paired with zero violations, and one bus hop cost 1 in 823 of the model's first token. The results show that the reversibility guarantee holds across processes and that assembly itself can leave the host process.
| Comments: | Still just draft, version 0.4.1. The author contributions are still under discussion, and the draft doesn't represent the final decision |
| Subjects: | Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA) |
| Cite as: | arXiv:2608.28553 [cs.AI] |
| (or arXiv:2608.28553v4 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2608.28553 arXiv-issued DOI via DataCite |
Submission history
From: Hanzhang Jia [view email]
[v1]
Fri, 28 Aug 2026 17:30:10 UTC (1,426 KB)
[v2]
Mon, 31 Aug 2026 05:59:16 UTC (1,445 KB)
[v3]
Sun, 6 Sep 2026 20:18:38 UTC (4,258 KB)
[v4]
Tue, 13 Oct 2026 16:44:41 UTC (26,942 KB)
来源：arXiv：cs.AI · arxiv.org