Amadio, Roberto and Dam, Mads (1996) *A Proof System for the pi-calculus.* [SICS Report]

| PDF 2449Kb |

## Abstract

We study the problem of specifying and verifying properties of pi-calculus processes while relying on a bisimulation semantics. As our property specification language we use a version of the modal mu-calculus adapted to the pi-calculus. We show that the logical language is sufficiently expressive to characterize by means of a finite formula a process up to any approximation of the bisimulation relation. We consider the problem of checking that a process of the pi-calculus satisfies a specification expressed in this modal mu-calculus. We develop an algorithm which is sound in general, and complete for processes having a finite reachability property. Finally, we present a proof system which can be applied to prove non-recursive properties of arbitrary processes. We show that the system is complete on the non-recursive fragment of the logical language.

Item Type: | SICS Report |
---|---|

Uncontrolled Keywords: | Process Algebra, Temporal Logic, Mobile Processes, Compositional Verification, Model Checking |

ID Code: | 2157 |

Deposited By: | Vicki Carleson |

Deposited On: | 22 Oct 2007 |

Last Modified: | 26 Sep 2016 13:56 |

Repository Staff Only: item control page