Show simple item record  

dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.date.accessioned2010-03-16T02:22:01Z
dc.date.available2010-03-16T02:22:01Z
dc.date.issued2009
dc.identifier.citationReeves, S. & Streader, D. (2009). Guarded operations, refinement and simulation. Electronic Notes in Theoretical Computer Science, 259, 177-191.en
dc.identifier.urihttps://hdl.handle.net/10289/3722
dc.description.abstractSimulation 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.mimetypeapplication/pdf
dc.language.isoen
dc.publisherElsevieren_NZ
dc.rightsThis 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.subjectcomputer scienceen
dc.subjectrefinementen
dc.subjectsimulationen
dc.subjectguardsen
dc.titleGuarded operations, refinement and simulationen
dc.typeJournal Articleen
dc.identifier.doi10.1016/j.entcs.2009.12.024en
dc.relation.isPartOfElectronic Notes in Theoretical Computer Science: Proceedings of the 14th BCS-FACS Refinement Workshop (REFINE 2009)en_NZ
pubs.begin-page177en_NZ
pubs.elements-id34651
pubs.end-page191en_NZ
pubs.issueCen_NZ
pubs.volume259en_NZ
uow.identifier.article-noCen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record