License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2018.17
URN: urn:nbn:de:0030-drops-85298
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8529/
Bollig, Benedikt ;
Fortin, Marie ;
Gastin, Paul
Communicating Finite-State Machines and Two-Variable Logic
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.
BibTeX - Entry
@InProceedings{bollig_et_al:LIPIcs:2018:8529,
author = {Benedikt Bollig and Marie Fortin and Paul Gastin},
title = {{Communicating Finite-State Machines and Two-Variable Logic}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-062-0},
ISSN = {1868-8969},
year = {2018},
volume = {96},
editor = {Rolf Niedermeier and Brigitte Vall{\'e}e},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8529},
URN = {urn:nbn:de:0030-drops-85298},
doi = {10.4230/LIPIcs.STACS.2018.17},
annote = {Keywords: communicating finite-state machines, MSO logic, message sequence charts}
}
Keywords: |
|
communicating finite-state machines, MSO logic, message sequence charts |
Collection: |
|
35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) |
Issue Date: |
|
2018 |
Date of publication: |
|
27.02.2018 |