Hennessy-Milner Logic with recursion as a specification language, and a refinement calculus based on it

Abstract

This paper is about specification and verification of processes, modeled as CCSagents.We show, by means of examples that Hennessy-Milner Logic (HML) with recursion is a suitable language for expressing implicit specifications. By extending this specification language with refinement operators, i.e. operators that describe the internal structure of a system, we obtain a calculus for stepwise refinement of agents from a specification in HML to a realization in CCS. The method is demonstrated by proving the alternating-bit protocol under weak assumptions about the unreliable media.