Evènement pour le groupe Séminaire Méthodes Formelles
|Date|| 2018-10-09 11:00-12:00|
|Titre||It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before" |
|Résumé||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.
This is joint work with Benedikt Bollig and Paul Gastin, presented at CONCUR’18.
|Orateur||Marie Fortin |
|Url||LSV, ENS Cachan |
Aucun document lié à cet événement.RetourRetour à l'index