dc.contributor.author | Reeves, Steve | |
dc.contributor.author | Streader, David | |
dc.date.accessioned | 2009-06-10T22:13:01Z | |
dc.date.available | 2009-06-10T22:13:01Z | |
dc.date.issued | 2009-06-10 | |
dc.identifier.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. | en |
dc.identifier.issn | 1177-777X | |
dc.identifier.uri | https://hdl.handle.net/10289/2196 | |
dc.description.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. | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.publisher | University of Waikato, Department of Computer Science | en |
dc.relation.ispartofseries | Computer Science Working Papers | |
dc.subject | computer science | en |
dc.subject | abstract data type | en |
dc.subject | simulation | en |
dc.title | Guarded operations, refinement and simulation | en |
dc.type | Working Paper | en |
uow.relation.series | 02/2009 | |