Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4230/LIPIcs.STACS.2018.17 | Leibniz International Proceedings in Informatics |
Keywords | DocType | Volume |
Communicating Finite-state Machines,MSO logic,Message Sequence Charts | Conference | 96 |
ISSN | Citations | PageRank |
1868-8969 | 0 | 0.34 |
References | Authors | |
3 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Bollig | 1 | 427 | 35.02 |
| Marie Fortin | 2 | 0 | 0.68 |
| Paul Gastin | 3 | 1165 | 75.66 |