Communicating Finite-State Machines and Two-Variable Logic

09/28/2017

∙

Communicating finite-state machines are a fundamental, well-studied model of finite-state processes that communicate via unbounded first-in first-out channels. We show that they are expressively equivalent to existential MSO logic with two first-order variables and the order relation.

READ FULL TEXT

Communicating Finite-State Machines and Two-Variable Logic

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

Design of an Optoelectronic State Machine with integrated BDD based Optical logic

A Scalable, Low-Overhead Finite-State Machine Overlay for Rapid FPGA Application Development

Finite State Machines for Semantic Scene Parsing and Segmentation

Finite State Machine Synthesis for Evolutionary Hardware

Realisability of Control-State Choreographies

Nominal Sets in Agda – A Fresh and Immature Mechanization

Communicating Finite-State Machines and Two-Variable Logic

Related Research

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

Design of an Optoelectronic State Machine with integrated BDD based Optical logic

A Scalable, Low-Overhead Finite-State Machine Overlay for Rapid FPGA Application Development

Finite State Machines for Semantic Scene Parsing and Segmentation

Finite State Machine Synthesis for Evolutionary Hardware

Realisability of Control-State Choreographies

Nominal Sets in Agda – A Fresh and Immature Mechanization