Getting to the Bottom of Relational Refinement: Relations and Correctness, Partial and Total
Eerke Boiten, Willem-Paul de Roever · Kent Academic Repository (University of Kent) · 2003
Relational theories of refinement using simulations exist based on total and on partial relations, modelling partial and total correctness. In order to model partialities such as non-termination and deadlock, domains of relations are often extended with, or assumed to include, a ``bottom'' value bot. This paper explores a number of such theories, all providing sound and jointly complete notions of simulations, concentrating on the role of bot.