Name
Title | ||
|---|---|---|
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic |
Abstract | ||
|---|---|---|
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. To this end, we introduce a star-free version of propositional dynamic logic (PDL) with loop and converse. Our main results state that (i) every first-order sentence can be transformed into an equivalent star-free PDL sentence (and conversely), and (ii) every star-free PDL sentence can be translated into an equivalent CFM. This answers an open question and settles the exact relation between CFMs and fragments of monadic second-order logic. As a byproduct, we show that first-order logic over MSCs has the three-variable property. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jcss.2020.06.006 | Journal of Computer and System Sciences |
Keywords | DocType | Volume |
Communicating finite-state machines,First-order logic,Happened-before relation,Propositional dynamic logic | Journal | 115 |
ISSN | Citations | PageRank |
0022-0000 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Bollig | 1 | 427 | 35.02 |
| Marie Fortin | 2 | 0 | 0.34 |
| Paul Gastin | 3 | 1165 | 75.66 |