Show simple item record  

dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.coverage.spatialConference held at Limerick, Irelanden_NZ
dc.date.accessioned2012-02-08T01:39:15Z
dc.date.available2012-02-08T01:39:15Z
dc.date.issued2011
dc.identifier.citationReeves, S. & Streader, D. (2011). Refinement for probabilistic systems with nondeterminism. In J. Derrick , E.A. Boiten & S. Reeves (Eds.), Proceedings of 15th International Refinement Workshop, EPTCS 55 (pp. 84-100).en_NZ
dc.identifier.urihttps://hdl.handle.net/10289/6003
dc.description.abstractBefore we combine actions and probabilities two very obvious questions should be asked. Firstly, what does "the probability of an action" mean? Secondly, how does probability interact with nondeterminism? Neither question has a single universally agreed upon answer but by considering these questions at the outset we build a novel and hopefully intuitive probabilistic event-based formalism. In previous work we have characterised refinement via the notion of testing. Basically, if one system passes all the tests that another system passes (and maybe more) we say the first system is a refinement of the second. This is, in our view, an important way of characterising refinement, via the question "what sort of refinement should I be using?" We use testing in this paper as the basis for our refinement. We develop tests for probabilistic systems by analogy with the tests developed for non-probabilistic systems. We make sure that our probabilistic tests, when performed on non-probabilistic automata, give us refinement relations which agree with for those non-probabilistic automata. We formalise this property as a vertical refinement.en_NZ
dc.language.isoen
dc.publisherEPTCSen_NZ
dc.relation.urihttp://www.springerlink.com/content/f6gt44f5rm4xtc0k/en_NZ
dc.rightsThis article has been published in Proceedings of 15th International Refinement Workshop. © Copyright with the authors.en_NZ
dc.subjectcomputer scienceen_NZ
dc.subjectnondeterminismen_NZ
dc.titleRefinement for probabilistic systems with nondeterminismen_NZ
dc.typeConference Contributionen_NZ
dc.identifier.doi10.4204/EPTCS.55.6en_NZ
dc.relation.isPartOfProceedings of the 15th International Refinement Workshop 2011; Electronic Proceedings in Theoretical Computer Science 55en_NZ
pubs.begin-page84en_NZ
pubs.elements-id20834
pubs.end-page100en_NZ
pubs.finish-date2011-06-20en_NZ
pubs.start-date2011-06-20en_NZ
pubs.volumeElectronic Proceedings in Theoretical Computer Science 55en_NZ


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record