A Compositional Proof System for the
Modal

-Calculus

Henrik Reif Andersen
Colin Stirling
Glynn Winskel

October 1994

Abstract:

We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal -calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal -calculus and combines it with techniques from work on local model checking. The proof system is sound for all processes and complete for a class of finite-state processes.

Available as PostScript, PDF, DVI.

Last modified: 2003-06-08 by webmaster.