A compositional proof system for the modal μ-calculus

Authors:
  • CSC. Stirling
    C. Stirling
  • GWG. Winskel
    G. Winskel

Abstract
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal /spl mu/-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal /spl mu/-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.

This publication has 14 references indexed in Scilit: