A compositional proof system for the modal μ-calculus
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 144-153
- https://doi.org/10.1109/lics.1994.316076
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.Keywords
This publication has 18 references indexed in Scilit:
- Definable operations in general algebras, and the theory of automata and flowchartsPublished by Springer Nature ,2006
- Compositionality through an operational semantics of contextsPublished by Springer Nature ,2005
- Model checking and boolean graphsTheoretical Computer Science, 1994
- Local model checking in the modal mu-calculusTheoretical Computer Science, 1991
- 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
- Synchronization treesTheoretical Computer Science, 1984
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955