Guarded Operations, Refinement and Simulation

Authors:
Steve Reeves;David Streader
Affiliations:
Department of Computer Science, University of Waikato, Hamilton, New Zealand;Department of Computer Science, University of Waikato, Hamilton, New Zealand
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 5
Cited 0

Data refinement refined

Proc. of the European symposium on programming on ESOP 86
General Refinement, Part One: Interfaces, Determinism and Special Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
General Refinement, Part Two: Flexible Refinement

Electronic Notes in Theoretical Computer Science (ENTCS)
Data Refinement: Model-Oriented Proof Methods and their Comparison

Data Refinement: Model-Oriented Proof Methods and their Comparison
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Quantified Score

Hi-index	0.00

Visualization

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.