Expand ↗
Page list (1268)

Commitment Machines

Yolum & Singh’s (ATAL-01) protocol formalism: states and actions carry declarative meaning in terms of the participants’ commitments rather than being mere FSM tokens, and transitions are inferred from the logical consequences of applying an action’s effect to the current meaning. A complete commitment machine is sound-and-completely compilable to a deterministic FSM, combining the executability advantages of FSMs with the meaning-preserving semantics of commitment-based specification — agents that cannot reason logically can still follow the compiled FSM, while agents that can reason logically can plan novel paths to a final meaning. Structurally a direct analogue of Endpoint Projection in Choreographic Programming.

In this vault

Backlinks