µACP: A Formal Calculus for Expressive, Resource-Constrained Agent Communication

Agent communication remains a foundational problem in multiagent systems protocols such as FIPA-ACL guarantee semantic richness but are intractable for constrained environments, while lightweight IoT protocols achieve efficiency at the expense of expressiveness. This paper presents 𝜇ACP, a formal calculus for expressive agent communication under explicit resource bounds. We formalizetheResource-ConstrainedAgentCommunication(RCAC) model, prove that a minimal four-verb basis {PING, TELL, ASK, OB- SERVE} is sufficient to encode finite-state FIPA protocols, and establish tight information-theoretic bounds on message complexity. We further show that 𝜇ACP can implement standard consensus under partial synchrony and crash faults, yielding a constructive coordination framework for edge-native agents. Formal verification in TLA+ (model checking) and Coq (mechanized invariants) establishes safety and boundedness, and supports liveness under modeled assumptions. Large-scale system simulations confirm ACP achieves a median end-to-end message latency of 34 ms (95th percentile 104 ms) at scale, achieving competitive or lower latency than representative agent and IoT protocols under the evaluated workloads. The main contribution is a unified calculus that reconciles semantic expressiveness with provable efficiency, providing a rigorousfoundationforthenextgenerationofresource-constrained multi-agent systems.

Authors

• Arnab Mallick Centre for Development of Advanced Computing
• Indraveni Chebolu Centre for Development of Advanced Computing

Keywords

• Agent Communication Languages
• Resource-Constrained Multi- Agent Systems
• Formal Protocol Calculus