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.

      Incremental verification of co-observability in discrete-event systems

      Liu, Huailiang; Leduc, Ryan J.; Malik, Robi; Ricker, S.L.
      Thumbnail
      Files
      2014 American Control Conference.pdf
      Accepted version, 363.7Kb
      DOI
       10.1109/ACC.2014.6859276
      Find in your library  
      Citation
      Export citation
      Liu, H., Leduc, R. J., Malik, R., & Ricker, S. L. (2014). Incremental verification of co-observability in discrete-event systems. In Proc 2014 American Control Conference (pp. 5446–5452). Portland, Oregon, USA: IEEE. http://doi.org/10.1109/ACC.2014.6859276
      Permanent Research Commons link: https://hdl.handle.net/10289/9257
      Abstract
      Existing strategies for verifying co-observability, one of the properties that must be satisfied for synthesizing solutions to decentralized supervisory control problems, require the construction of the complete system model. When the system is composed of many subsystems, these monolithic approaches may be impractical due to the state-space explosion problem. To address this issue, we introduce an incremental verification of co-observability approach. Selected subgroups of the system are evaluated individually, until verification of co-observability is complete. The new method is potentially much more efficient than the monolithic approaches, in particular for systems composed of many subsystems, allowing for some intractable state-space explosion problems to be manageable. Properties of this new strategy are presented, along with a corresponding algorithm and an example.
      Date
      2014
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      This is an author’s accepted version of an article published in the Proceedings of American Control Conference (ACC), 2014. © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      39
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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