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.
2018.Agent-Based Computing in the Internet of Things: A Survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.