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.

      Generalised Nonblocking

      Malik, Robi; Leduc, Ryan
      Thumbnail
      Files
      Generalised Nonblocking.pdf
      111.5Kb
      DOI
       10.1109/WODES.2008.4605969
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Malik, R & Leduc, R.(2008). Generalised Nonblocking. In B. Lennartson, M. Fabian, K. Åkesson, A. Giua & R. Kumar(Eds), Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden; 28-30 May, 2008(pp.340-345). Washington, DC, USA: IEEE Computer Society.
      Permanent Research Commons link: https://hdl.handle.net/10289/1785
      Abstract
      This paper studies the nonblocking check used in supervisory control of discrete event systems and its limitations. Different examples with different liveness requirements are discussed. It is shown that the standard nonblocking check can be used to specify most requirements of interest, but that it lacks expressive power in a few cases. A generalised nonblocking check is proposed to overcome the weakness, and its relationship to standard nonblocking is explored. Results suggest that generalised nonblocking, while having the same useful properties with respect to synthesis and compositional verification, can provide for more concise problem representations in some cases.
      Date
      2008
      Type
      Conference Contribution
      Publisher
      IEEE Computer Society
      Rights
      This article has been published in the Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden; 28-30 May, 2008. ©2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to severs or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      49
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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