Incompleteness of relational simulations in the blocking paradigm

13 years 2 months ago

Download www.cs.kent.ac.uk

Reﬁnement is the notion of development between formal speciﬁcations. For speciﬁcations given in a relational formalism, downward and upward simulations are the standard method to verify that a reﬁnement holds, their usefulness based upon their soundness and joint completeness. This is known to be true for total relational speciﬁcations and has been claimed to hold for partial relational speciﬁcations in both the non-blocking and blocking interpretations. 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.

Eerke A. Boiten, John Derrick

Real-time Traffic