S-Bus: Automatic Read-Set Reconstruction for Multi-Agent LLM State Coordination
On the map: LLM agents and tool use → Agent memory systems
Abstract (arXiv)
We address concurrency control for LLM agents sharing mutable state over HTTP, where agents cannot be modified to declare read sets. S-Bus is an HTTP middleware whose central mechanism, a server-side DeliveryLog, reconstructs each agent's read set at commit time from observed HTTP GET traffic. The consistency property it provides -- Observable-Read Isolation (ORI), a partial causal consistency over the HTTP-observable read projection -- prevents Structural Race Conditions in dedicated-shard topologies. Three contributions. (C1) DeliveryLog mechanism with three-tier mechanised evidence: TLAPS proves ReadSetSoundness and ORICommitSafety (modulo one typing axiom); exhaustive TLC at N=3 explores 20,763,484 states with zero violations; Dafny discharges 9 inductive lemmas. (C2) Empirical safety parity against PostgreSQL 17 SERIALIZABLE and Redis 7 WATCH/MULTI: zero Type-I corruptions across 884,110 commit attempts (427,308 under active contention). (C3) ORI is semantically neutral in dedicated-shard workloads but harmful in single-shard collaborative writing because preservation propagates concurrent contradictions. v2 update: the PH-3 LLM judge is now independently validated against a human annotator (Zahid Hussain, Mindgigs Peshawar) on 400 (step, shard) pairs at strict kappa=0.93 (n=93, 96.8% raw agreement). Inter-LLM-judge agreement is kappa=0.46 (boundary variance). Agent self-reports over-claim shard usage by 32% (LLM judge) to 49% (human annotator). The SJ-v4 semantic-quality rubric remains single-judge LLM-only. Source code, formal proofs, harness, annotation data: https://github.com/sajjadanwar0/sbus
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Placed in Agent memory systems, one of 16 directions in LLM agents and tool use. Builds on 6 of its 51 references that are in the map. First posted on arXiv 16 May 2026.
Builds on
6 of 51 references.
References · 6
- 2023Generative Agents: Interactive Simulacra of Human Behaviorcited by 3,568
- 2023Voyager: An Open-Ended Embodied Agent with Large Language Modelscited by 2,191
- 2024SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineeringcited by 1,737
- 2023Large Language Models are not Fair Evaluatorscited by 1,085
- 2024AgentScope: A Flexible yet Robust Multi-Agent Platformcited by 121
- 2023Verus: Verifying Rust Programs using Linear Ghost Types (extended version)cited by 53
Built on by
Citing papers per year: 2026: 8.
8 papers.
- 2026TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memorycited by 8
- 2026CoAgent: Concurrency Control for Multi-Agent Systemscited by 4
- 2026ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesiscited by 3
- 2026When AI Agents Commit: Cognitive Serializability Across Data, Evidence, Policy, and Authoritycited by 2
- 2026Stateful Governance for Concurrent Agentic Systemscited by 0
- 2026Fresh Memory, Stale Plans: Dependency-Scoped Validation for Distributed LLM-Agent Memorycited by 0
- 2026When Tool Calls Succeed but Workflows Fail: Anomalies at the Agent-Tool Boundarycited by 0
- 2026Stale Does Not Mean Unsafe: Guard Precision for Tool-Using LLM Agents under Infrastructure State Racescited by 0
- 2026When Tool Calls Succeed but Workflows Fail: Anomalies at the Agent-Tool Boundary14 Sep 2026
- 2026Fresh Memory, Stale Plans: Dependency-Scoped Validation for Distributed LLM-Agent Memory3 Sep 2026
- 2026Stale Does Not Mean Unsafe: Guard Precision for Tool-Using LLM Agents under Infrastructure State Races25 Aug 2026
- 2026Stateful Governance for Concurrent Agentic Systems3 Aug 2026
- 2026When AI Agents Commit: Cognitive Serializability Across Data, Evidence, Policy, and Authority28 Jul 2026
- 2026ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesis29 Jun 2026
- 2026CoAgent: Concurrency Control for Multi-Agent Systems13 Jun 2026
- 2026TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory4 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2026Verified Detection and Prevention of Concurrency Anomalies in Multi-Agent Large Language Model Systems
- 2026Position: Multi-Agent Systems Should Prioritize Concurrency Control
- 2026ContractBench: Can LLM Agents Preserve Observation Contracts?
- 2026Governed Shared Memory for Multi-Agent LLM Systems
- 2026SecureClaw: Clawing Back Control of LLM Agents
- 2026MemTX: Transactional Belief Commit for Stateful Agent Memory
- 2026When JSON Is Not Enough: Semantic Reliability of Schema-Constrained LLM Ordering Agents
- 2026Revocation Is Not Complete at Receipt: An Executable Outcome Contract for Distributed Agent-Tool Gateways