Location of Repository

Incompleteness of relational simulations in the blocking paradigm

By E. Boiten and J. Derrick


Refinement is the notion of development between formal specifications For specifications given in a relational formalism downward and upward simulations are the standard method to verify that a refinement holds their usefulness based upon their soundness and joint completeness This is known to be true for total relational specifications and has been claimed to hold for partial relational specifications in both the non-blocking and blocking interpretations\ud \ud In this paper we show that downward and upward simulations in the blocking interpretation where domains are guards are not Jointly complete This contradicts earlier claims in the literature We illustrate this with an example (based on one recently constructed by Reeves and Streader) and then construct a proof to show why Joint completeness fails in general (C) 2010 Elsevier B V All rights reserved\u

Publisher: Elsevier
Year: 2010
OAI identifier: oai:eprints.whiterose.ac.uk:42816

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.