Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Refinement for probabilistic systems with nondeterminism

      Reeves, Steve; Streader, David
      DOI
       10.4204/EPTCS.55.6
      Link
       www.springerlink.com
      Find in your library  
      Citation
      Export citation
      Reeves, 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).
      Permanent Research Commons link: https://hdl.handle.net/10289/6003
      Abstract
      Before 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.
      Date
      2011
      Type
      Conference Contribution
      Publisher
      EPTCS
      Rights
      This article has been published in Proceedings of 15th International Refinement Workshop. © Copyright with the authors.
      Collections
      • Computing and Mathematical Sciences Papers [1452]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement