Conference paper
A compositional proof system for the modal μ-calculus
In
Proceedings of the Symposium of Logic in Computer Science
—
1994, pp. 144-153
Abstract
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal μ-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal μ-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
| Language: | English |
|---|---|
| Publisher: | IEEE |
| Year: | 1994 |
| Pages: | 144-153 |
| Proceedings: | Symposium on Logic in Computer Science |
| ISBN: | 0818663103 and 9780818663109 |
| Types: | Conference paper |
| DOI: | 10.1109/LICS.1994.316076 |
