dc.contributor.author | Reeve, Greg | |
dc.contributor.author | Reeves, Steve | |
dc.date.accessioned | 2008-10-13T03:36:10Z | |
dc.date.available | 2008-10-13T03:36:10Z | |
dc.date.issued | 2000-03 | |
dc.identifier.citation | Reeve, 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.issn | 1170-487X | |
dc.identifier.uri | https://hdl.handle.net/10289/1022 | |
dc.description.abstract | In 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.mimetype | application/pdf | |
dc.language.iso | en | |
dc.publisher | University of Waikato, Department of Computer Science | en_US |
dc.relation.ispartofseries | Computer Science Working Papers | |
dc.subject | computer science | en_US |
dc.subject | u-chart | en_US |
dc.title | µ-Charts and Z: hows, whys and wherefores | en_US |
dc.type | Working Paper | en_US |
uow.relation.series | 00/06 | |