A Proof System for the pi-calculus
Number of Authors: 2
1996 (English)Report (Refereed)
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.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1996, 9. , 28 p.
SICS Technical Report, ISSN 1100-3154 ; R96:03
Process Algebra, Temporal Logic, Mobile Processes, Compositional Verification, Model Checking
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21408OAI: oai:DiVA.org:ri-21408DiVA: diva2:1041444