A refinement calculus for specifications in Hennessy-Milner logic with recursion-Reference-Cited by-同舟云学术

A refinement calculus for specifications in Hennessy-Milner logic with recursion

Published:1989-03 Issue:1 Volume:1 Page:242-272
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Holmström Sören¹

Affiliation:

1. Programming Methodology Group, Department of Computer Science, Chalmers University of Technology, S-412 96, Göteborg, Sweden

Abstract

Abstract This paper is about specification and verification of processes, modelled as CCS-agents. We show, by means of examples that Hennessy-Milner Logic (HML) with recursion is a suitable language for expressing implicit or partial 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 realisation in CCS. The method is demonstrated by proving the alternating-bit protocol under weak assumptions about the unreliable media.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01887208.pdf

Reference15 articles.

1. Brookes S. and Rounds W.: Behavioural equivalences induced by programming logics ICALP'83 LNCS 154 Springer-Verlag 1983.

2. Graf S. and Sifakis J.: A modal characterization of observational congruence on finite terms of CCS ICALP'84 LNCS 172 Springer-Verlag 1984.

3. Hennessy M. and Milner R.: Algebraic laws for Nondeterminism and Concurrency. J. ACM 32(1) (1985).

4. Kozen D.: Results on the Propositional μ -calculus ICALP'82 LNCS 140 Springer-Verlag 1982.

5. Larsen K.G.: Context-Dependent Bisimulation between Processes Ph.D. thesis CST-37-86 University of Edinburgh 1986.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. 30 Years of Modal Transition Systems: Survey of Extensions and Analysis;Lecture Notes in Computer Science;2017

2. Parametric and Quantitative Extensions of Modal Transition Systems;From Programs to Systems. The Systems perspective in Computing;2014

3. On Refinement and Temporal Annotations;Lecture Notes in Computer Science;2000

4. Disjunction of LOTOS specifications;Formal Description Techniques and Protocol Specification, Testing and Verification;1997

5. Specifying and verifying parametric processes;Mathematical Foundations of Computer Science 1996;1996