It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"

19 Oct 2018 Bollig Benedikt Fortin Marie Gastin Paul

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • FORMAL LANGUAGES AND AUTOMATA THEORY