A Compositional Proof System for the Modal mu-Calculus
Authors:
- Henrik Reif AndersenHAHenrik Reif Andersen
- Colin StirlingCSColin Stirling
- Glynn WinskelGWGlynn Winskel
Open Access
- 15 October 1994
- journal article
- Published by Det Kgl. Bibliotek/Royal Danish Library in BRICS Report Series
- Vol. 1 (34)
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.Keywords
This publication has 13 references indexed in Scilit:
- Model checking and boolean graphsTheoretical Computer Science, 1994
- Faster model checking for the modal Mu-Calculus1993
- Compositional checking of satisfactionFormal Methods in System Design, 1992
- Local model checking in the modal mu-calculusTheoretical Computer Science, 1991
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- A compositional proof system on a category of labelled transition systemsInformation and Computation, 1990
- A linear algorithm to solve fixed-point equations on transition systemsInformation Processing Letters, 1988
- Modal logics for communicating systemsTheoretical Computer Science, 1987
- On the composition and decomposition of assertionsLecture Notes in Computer Science, 1985
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955