It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"

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.

[1]  Maurizio Lenzerini,et al.  Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.

[2]  Igor Walukiewicz,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[3]  Anca Muscholl,et al.  Bounded MSC communication , 2002, Inf. Comput..

[4]  Carsten Lutz,et al.  2-Exp Time lower bounds for propositional dynamic logics with intersection , 2005, Journal of Symbolic Logic.

[5]  Dietrich Kuske,et al.  Regular sets of infinite message sequence charts , 2003, Inf. Comput..

[6]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

[7]  Benedikt Bollig,et al.  Propositional Dynamic Logic for Message-Passing Systems , 2007, FSTTCS.

[8]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[9]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[10]  W. Hanf.  MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC , 2014 .

[11]  Dov M. Gabbay,et al.  EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .

[12]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[13]  Carsten Lutz,et al.  PDL with intersection and converse: satisfiability and infinite-state model checking , 2009, The Journal of Symbolic Logic.

[14]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[15]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[16]  Benedikt Bollig,et al.  Communicating Finite-State Machines and Two-Variable Logic , 2017, STACS.

[17]  Martin Lange,et al.  Model checking propositional dynamic logic with all extras , 2006, J. Appl. Log..

[18]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[19]  Roy Mennicke,et al.  Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems , 2012, CONCUR.

[20]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[21]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[22]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[23]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[24]  Paul Gastin,et al.  First-order definable languages , 2008, Logic and Automata.

[25]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[26]  Anca Muscholl,et al.  A Kleene theorem and model checking algorithms for existentially bounded communicating automata , 2006, Inf. Comput..

[27]  Benedikt Bollig,et al.  Propositional Dynamic Logic for Message-Passing Systems , 2010, Log. Methods Comput. Sci..

[28]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[29]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[30]  Anca Muscholl,et al.  On Communicating Automata with Bounded Channels , 2007, Fundam. Informaticae.

[31]  Paul B. Freeman.  It is easy to be wise after the event , 2006 .