Show simple item record  

dc.contributor.authorReeve, Greg
dc.contributor.authorReeves, Steve
dc.date.accessioned2008-10-13T03:36:10Z
dc.date.available2008-10-13T03:36:10Z
dc.date.issued2000-03
dc.identifier.citationReeve, G. & Reeves, S. (2000). µ-Charts and Z: hows, whys and wherefores. (Working paper 00/06). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1022
dc.description.abstractIn this paper we show, by a series of examples, how the µ-chart formalism can be translated into Z. We give reasons for why this is an interesting and sensible thing to do and what it might be used for.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_US
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.subjectu-charten_US
dc.titleµ-Charts and Z: hows, whys and whereforesen_US
dc.typeWorking Paperen_US
uow.relation.series00/06


Files in this item

This item appears in the following Collection(s)

Show simple item record