It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"
share
Message sequence charts (MSCs) naturally arise as executions of communicating finite-state machines (CFMs), in which finite-state processes exchange messages through unbounded FIFO channels. We study the first-order logic of MSCs, featuring Lamport's happened-before relation. Our main result states that every first-order sentence can be transformed into an equivalent CFM. This answers an open question and settles the exact relation between CFMs and fragments of monadic second-order logic. As a byproduct, we obtain self-contained normal-form constructions for first-order logic over MSCs (and, therefore, over words). In particular, we show that first-order logic has the three-variable property.
READ FULL TEXT