Guarded operations, refinement and simulation
| dc.contributor.author | Reeves, Steve | |
| dc.contributor.author | Streader, David | |
| dc.date.accessioned | 2010-03-16T02:22:01Z | |
| dc.date.available | 2010-03-16T02:22:01Z | |
| dc.date.issued | 2009 | |
| 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. | en |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Reeves, S. & Streader, D. (2009). Guarded operations, refinement and simulation. Electronic Notes in Theoretical Computer Science, 259, 177-191. | en |
| dc.identifier.doi | 10.1016/j.entcs.2009.12.024 | en |
| dc.identifier.uri | https://hdl.handle.net/10289/3722 | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | en_NZ |
| dc.relation.isPartOf | Electronic Notes in Theoretical Computer Science: Proceedings of the 14th BCS-FACS Refinement Workshop (REFINE 2009) | en_NZ |
| dc.rights | This is an author’s accepted version of an article published in the journal: Electronic Notes in Theoretical Computer Science. © 2009 Elsevier B. V. | en |
| dc.subject | computer science | en |
| dc.subject | refinement | en |
| dc.subject | simulation | en |
| dc.subject | guards | en |
| dc.title | Guarded operations, refinement and simulation | en |
| dc.type | Journal Article | en |
| dspace.entity.type | Publication | |
| pubs.begin-page | 177 | en_NZ |
| pubs.end-page | 191 | en_NZ |
| pubs.issue | C | en_NZ |
| pubs.volume | 259 | en_NZ |
| uow.identifier.article-no | C | en_NZ |