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.

      Advanced selfloop removal in compositional nonblocking verification of discrete event systems

      Malik, Robi
      Thumbnail
      Files
      case2015.pdf
      Accepted version, 150.5Kb
      DOI
       10.1109/CoASE.2015.7294182
      Find in your library  
      Citation
      Export citation
      Malik, R. (2015). Advanced selfloop removal in compositional nonblocking verification of discrete event systems. In Proceeding of IEEE International Conference on Automation Science and Engineering, Gothenburg, Sweden, 24-28 August, 2015 (pp. 819–824). USA: IEEE. http://doi.org/10.1109/CoASE.2015.7294182
      Permanent Research Commons link: https://hdl.handle.net/10289/10254
      Abstract
      This paper investigates possible improvements of abstraction to simplify finite-state machines during compositional nonblocking verification of large discrete event systems. Current methods to simplify finite-state machines depend on the absence of transitions from the states to be simplified, and selfloop transitions, i.e., transitions with the same source and target state, are a common culprit that prevents simplification. Some methods to remove such selfloops are known, but they require events that appear on selfloops in the entire finitestate machine to be simplified. The methods described in this paper improve on this, because they allow for the removal of individual selfloop transitions from a finite-state machine while preserving conflict equivalence. This makes it possible to remove more transitions, thus reducing the computational effort of compositional nonblocking verification. Two abstraction rules are proposed, and experimental results show the potential of improvement over previously used methods.
      Date
      2015
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      This is an author’s accepted version of an article published in the Proceeding of IEEE International Conference on Automation Science and Engineering. ©2015 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 servers 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 [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      117
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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