A Modal Logic for Message passing Processes (Extended Abstract)

A first-order modal logic is given for describing properties of processes which may send and receive values or messages along communication ports. We give two methods for proving that a process enjoys such a property. The first is the construction, for each process P and formula F, of a characteristic formula P sat F such that P enjoys the property F if and only if the formula P sat F is logically equivalent to tt. The second is a sound and complete proof system whose judgements take the form B ⊢ P∶F, meaning: under the assumption B the process P enjoys the property F. The notion of symbolic operational semantics plays a crucial role in the design of both the characteristic formulae and the proof system.

[1]  Joseph Sifakis,et al.  A Logic for the Description of Non-deterministic Programs and Their Properties , 1986, Inf. Control..

[2]  Matthew Hennessy,et al.  A modal logic for message passing processes , 1995 .

[3]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[6]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[7]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, Theor. Comput. Sci..

[8]  Huimin Lin,et al.  A Verification Tool for Value-Passing Processes , 1993, PSTV.

[9]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.