A Compositional Proof System for the Modal mu-Calculus
Keyword(s):
We present a proof system for determining satisfaction between<br />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.
Keyword(s):
1992 ◽
Vol 96
(1)
◽
pp. 157-174
◽
2017 ◽
Vol 15
(1)
◽
pp. 421
1993 ◽
pp. 447-461
◽
1997 ◽
Vol 183
(2)
◽
pp. 229-251
◽
2013 ◽
pp. 178-195
◽
Keyword(s):
1989 ◽
pp. 369-383
◽
2003 ◽
Vol 29
(6)
◽
pp. 510-523
◽