Incompleteness of relational simulations in the blocking paradigm

Eerke Boiten, John Derrick
2010 Science of Computer Programming  
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. In this paper we show that
more » ... 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.
doi:10.1016/j.scico.2010.07.003 fatcat:5fm5ym7tgjayrnfq7fjdnmvxeq