A Compositional Proof System for the Modal mu-Calculus
AbstractWe present a proof system for determining satisfaction between
processes in a fairly general process algebra and assertions of the modal mu-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal 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.
How to Cite
Andersen, H., Stirling, C., & Winskel, G. (1998). A Compositional Proof System for the Modal mu-Calculus. BRICS Report Series, 5(40). https://doi.org/10.7146/brics.v5i40.19485
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.