Communicating Finite-State Machines and Two-Variable Logic
Logic in Computer Science
2017-09-29 v1 Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1709.09991,
title = {Communicating Finite-State Machines and Two-Variable Logic},
author = {Benedikt Bollig and Marie Fortin and Paul Gastin},
journal= {arXiv preprint arXiv:1709.09991},
year = {2017}
}