Show simple item record  

dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.date.accessioned2009-06-10T22:13:01Z
dc.date.available2009-06-10T22:13:01Z
dc.date.issued2009-06-10
dc.identifier.citationReeves, 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.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/2196
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. 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.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen
dc.subjectabstract data typeen
dc.subjectsimulationen
dc.titleGuarded operations, refinement and simulationen
dc.typeWorking Paperen
uow.relation.series02/2009


Files in this item

This item appears in the following Collection(s)

Show simple item record