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.

      A compositional approach for verifying generalized nonblocking

      Malik, Robi; Leduc, Ryan
      DOI
       10.1109/ICCA.2009.5410548
      Find in your library  
      Citation
      Export citation
      Malik, R. & Leduc, R. (2009). A compositional approach for verifying generalized nonblocking. In Proceedings of 2009 IEEE International Conference on Control and Automation (ICCA 2009), 9-11 December 2009 (pp. 448-453). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/4607
      Abstract
      This paper proposes a compositional approach to verify the generalised nonblocking property of discrete-event systems. Generalised nonblocking is introduced in to overcome weaknesses of the standard nonblocking check in discrete-event systems and increase the scope of liveness properties that can be handled. This paper addresses the question of how generalised nonblocking can be verified efficiently. The explicit construction of the complete state space is avoided by first composing and simplifying individual components in ways that preserve generalised nonblocking. The paper extends and generalises previous results about compositional verification of standard nonblocking and lists a new set of computationally feasible abstraction rules for standard and generalised nonblocking.
      Date
      2009
      Type
      Conference Contribution
      Publisher
      IEEE
      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