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
      • Computer Science Working Paper Series
      • 2011 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2011 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      An implementation of a compositional approach for verifying generalised nonblocking

      Francis, Rachel
      Thumbnail
      Files
      uow-cs-wp-2011-04.pdf
      621.9Kb
      Find in your library  
      Citation
      Export citation
      Francis, R. (2011). An implementation of a compositional approach for verifying generalised nonblocking. (Working paper 04/2011). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/5312
      Abstract
      Generalised nonblocking is a property of discrete-event systems which verifies liveness. It was introduced to overcome the weaknesses of standard nonblocking. Verifying generalised nonblocking of real-world models often involves exploring state-spaces which will exceed available memory. A compositional verification approach has been developed to achieve verification for models of a much larger size. For this project, we have developed the first implementation for compositionally verifying generalised nonblocking. In addition, we have experimented with the techniques used in compositional verification, and analysed their performance. Our algorithm has successfully verified a large set of industrial-size models, including at least one large model which had not been verified before.
      Date
      2011-04-27
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      04/2011
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 2011 Working Papers [4]
      Show full item record  

      Usage

      Downloads, last 12 months
      26
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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