A Modal Logic for pi-Calculus and Model Checking Algorithm

The π-calculus is one of the most important mobile process calculi and has been well studied in the literatures. Temporal logic is thought as a good compromise between description convenience and abstraction and can support useful computational applications, such as model-checking. In this paper, we use symbolic transition graph inherited from π-calculus to model concurrent systems. A wide class of processes, that is, the finite-control processes can be represented as finite symbolic transition graph. A new version π-μ-Logic is introduced as an appropriate temporal logic for the π-calculus. Since we make a distinction between proposition and predicate, the possible interactions between recursion and first-order quantification can be solved. A concise semantics interpretation for our modal logic is given. Based on the above work, we provide a model checking algorithm for the logic, which follows the well-known Winskel's tag set method to deal with fixpoint operator. As for the problem of name instantiating, our algorithm follows the 'on-the-fly' style, and systematically employs schematic names. The correctness of the algorithm is shown.

[1]  Julian Rathke,et al.  Local Model Checking for Value-Passing Processes (Extended Abstract) , 1997, TACS.

[2]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[3]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[4]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

[5]  Luca Cardelli,et al.  A Spatial Logic for Concurrency , 2001, TACS.

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

[7]  Roberto M. Amadio,et al.  Toward a Modal Theory of Types for the pi-Calculus , 1996, FTRTFT.

[8]  Julian Rathke,et al.  Local model checking for value-passing processes , 1997 .

[9]  Zhoujun Li,et al.  Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus , 1998, ICALP.

[10]  Mads Dam Proof Systems for π-Calculus Logics , 2003, Logic for Concurrency and Synchronisation.

[11]  Luca Cardelli,et al.  A Spatial Logic for Concurrency (Part II) , 2002, CONCUR.

[12]  Mads Dam,et al.  On the Decidability of Process Equivalences for the pi-calculus , 1995, International Conference on Algebraic Methodology and Software Technology.

[13]  Ruy J. G. B. de Queiroz,et al.  Logic for Concurrency and Synchronisation , 2003, Trends in Logic.

[14]  Huimin Lin Complete Inference Systems for Weak Bisimulation Equivalences in the pi-Calculus , 1995, TAPSOFT.

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

[16]  Mads Dam,et al.  Model Checking Mobile Processes , 1993, Inf. Comput..

[17]  Huimin Lin,et al.  Model checking value-passing processes , 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

[18]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[19]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[20]  Luca Cardelli,et al.  A spatial logic for concurrency (part I) , 2003, Inf. Comput..

[21]  Glynn Winskel,et al.  A Note on Model Checking the Modal nu-Calculus , 1991, Theor. Comput. Sci..

[22]  Matthew Hennessy,et al.  A modal logic for message passing processes , 2005, Acta Informatica.