A four-verb calculus claims to encode all finite-state FIPA protocols with near-optimal messages and consensus support, but the proofs are sketched and the real expressive load sits in TLV options, not the verbs.
Title resolution pending
1 Pith paper cite this work, alongside 442 external citations. Polarity classification is still indexing.
1
Pith paper citing it
442
external citations · OpenAlex
fields
cs.MA 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
{\mu}ACP: A Formal Calculus for Expressive, Resource-Constrained Agent Communication
A four-verb calculus claims to encode all finite-state FIPA protocols with near-optimal messages and consensus support, but the proofs are sketched and the real expressive load sits in TLV options, not the verbs.