Reeves, S. & Streader, D. (2009). Guarded operations, refinement and simulation. Electronic Notes in Theoretical Computer Science, 259, 177-191.
Permanent Research Commons link: http://hdl.handle.net/10289/3722
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.
This is an author’s accepted version of an article published in the journal: Electronic Notes in Theoretical Computer Science. © 2009 Elsevier B. V.