Titlebook: Refinement; Semantics, Languages John Derrick,Eerke Boiten Textbook 2018 Springer International Publishing AG, part of Springer Nature 2018

negligence

外表讀作

骨

青春期

清澈

State-Based Languages: Z and Bocus in a description. In this chapter we illustrate the approach to state-based specification by briefly introducing the Z and B notations, and showing how we can apply our theory of refinement to them.

Flawless

Labeled Transition Systems and Their Refinementach refinement relation we introduce is more discriminating than the last. The most discriminating of all, bisimulation, will then be introduced in Chap.?.. The material in this chapter serves as the foundation of refinement in process algebras such as CSP, CCS and LOTOS which we consider in Chap.?..

拋媚眼

大都市

Relating Data Refinement and Failures-Divergences Refinementthe context of failures refinement (see Sect.?.). In this chapter we consider failures refinement in more depth, and in particular start to discuss the role that inputs and outputs have in a relational framework and how they correspond to aspects of divergence and refusals.

infringe

Process AlgebraThis chapter looks at these issues in process algebras. As a canonical example we look at CSP, but we also discuss CCS and LOTOS. The link to the semantics is made to Chap.?. as well as elements of Chap.?..

ethereal

ConclusionsThe purpose of this book has been to explain the foundations for refinement in a variety of semantic models, and then see how these foundations are realised in some example specification languages. This has taken us on a tour through some different ways of looking at computation.