Weak Refinement in Z

An important aspect in the specification of distributed systems is the role of the internal (or unobservable) operation. Such operations are not part of the user interface (i.e. the user cannot invoke them), however, they are essential to our understanding and correct modelling of the system. Various conventions have been employed to model internal operations when specifying distributed systems in Z. If internal operations are distinguished in the specification notation, then refinement needs to deal with internal operations in appropriate ways. However, in the presence of internal operations, standard Z refinement leads to undesirable implementations.

[1]  Elspeth Cusack.  Object Oriented Modelling in Z for Open Distributed Systems , 1991, Open Distributed Processing.

[2]  Howard Bowman,et al.  Comparing LOTOS and Z Refinement Relations , 1996, FORTE.

[3]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[4]  Howard Bowman,et al.  Consistency and Refinement for Partial Specification in Z , 1996, FME.

[5]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[6]  John L Berg,et al.  Protocol specification, testing, and verification, IV: edited by Shaula Yemini, Yechiam Yemini, and Robert Strom, 1987; North-Holland, Amsterdam, The Netherlands; 720 pages; hardback; $75.00; Illustrations, references; ISBN 0 444 87676 6. , 1988 .

[7]  Pamela Zave,et al.  Formal Specification of Telephone Features , 1994, Z User Workshop.

[8]  Howard Bowman,et al.  Supporting ODP - Translating LOTOS to Z , 1997 .

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  Clazien D. Wezeman,et al.  Z for Managed Objects , 1994, Z User Workshop.

[11]  Clazien D. Wezeman,et al.  Deriving Tests for Objects Specified in Z , 1992, Z User Workshop.

[12]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[13]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[14]  Steve Rudkin,et al.  Modelling Information Objects in Z , 1991, Open Distributed Processing.

[15]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[16]  Ben Strulo.  How Firing Conditions Help Inheritance , 1995, ZUM.

[17]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.