Guarded operations, refinement and simulation

Abstract

Simulation rules have long been used as an effective computational means to decide refinement relations in state-based formalisms. Here we investigate how they might be amended so as to decide the event-based notion of singleton failures refinement of abstract data types or processes that have operations with a "guarded" interpretation. As the results presented here and found elsewhere in the literature are so sensitive to the details of the definitions used, we have machine-checked our results.

Citation

Reeves, S. & Streader, D. (2009). Guarded operations, refinement and simulation. (Working paper 02/2009). Hamilton, New Zealand: University of Waikato, Department of Computer Science.

Publisher

University of Waikato, Department of Computer Science

Degree

Type of thesis

Supervisor