Logos：一种跨进程总线的智能体管控工具
Logos: An Agent Harness on a Cross-Process Bus
浏览论文内容
中文总结 AI 辅助
本文基于时空可组合性演算等观察构建了跨进程智能体管控工具Logos，经实验验证其可在故障场景下保障会话恢复且无重复效果，性能优于单进程架构。
中文摘要 AI 辅助
现代智能体系统在运行时组装各类能力，这种动态组合近期在时空可组合性演算中得到了完整的形式化处理，其中能力是携带可跟踪逆元的组件，智能体则作为插件被组装。该插件形式由单个进程承载，共享同一上下文，该载体将所有组件置于同一物理故障域中，故障会同时暂停所有组件，进程终止会中断其承载的所有会话。本文表明，无论是建模还是演算，都未将智能体绑定到单个进程；该语言模型的无状态性使所有跨步骤状态都处于模型之外；健全性不变量仅定义在状态空间上。这些观察结果浓缩为四个引理，其前提为演算的假设以及语言模型推理的无状态性。基于这些引理，本文构建了Logos，一种类似ROS的跨进程智能体管控工具，其中插件是进程，唯一共享状态是仅追加的记录。在工具调用周期的四个边界处进行终止操作后，80个会话可恢复且无重复效果；与单进程参考配置的同故障对比显示，在对等进程架构下，一个故障会在一个节点处终止，而单进程架构下一个故障会中断所有共存会话。
英文摘要
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.
发表机构
- University of Sussex（萨塞克斯大学）
- Zhejiang Gongshang University（浙江工商大学）
- Shanghai Shuyuan Information Technology Co., Ltd.（上海数元信息技术有限公司）
机构由 AI 辅助整理，请以论文原文为准。
