A Compositional Proof System for the Modal mu-Calculus

Henrik Reif Andersen, Colin Stirling, Glynn Winskel

Abstract


We 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.

Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v1i34.21609
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library