Selected publications at LSV

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. 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.

   address = {Beijing, China},
   author = {Bollig, Benedikt and Fortin, Marie and Gastin, Paul},
   booktitle = {{P}roceedings of the 29th {I}nternational {C}onference on {C}oncurrency {T}heory ({CONCUR}'18)},
   DOI = {10.4230/LIPIcs.CONCUR.2018.7},
   editor = {Schewe, Sven and Zhang, Lijun},
   month = sep,
   pages = {7:1-7:17},
   publisher = {Leibniz-Zentrum f{\"u}r Informatik},
   series = {Leibniz International Proceedings in Informatics},
   title = {It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ''Happened Before''},
   url = {},
   volume = {118},
   year = {2018},

About LSV

Select by Year