Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • FAQs
        • 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.

      Variable abstraction and approximations in supervisory control synthesis

      Teixeira, Marcelo; Malik, Robi; Cury, José E. R.; de Queiroz, Max. H.
      Thumbnail
      Files
      acc2013.pdf
      154.4Kb
      DOI
       10.1109/ACC.2013.6579826
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Teoxeira, M., Malik, R., Cury, J. E. R. De Queiroz, M. H. (2013). Variable abstraction and approximations in supervisory control synthesis. In Proceedings of American Control Conference (ACC'13), Washington DC, USA (pp. 132-137). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/8091
      Abstract
      This paper proposes a method to simplify Extended Finite-state Automata (EFA) in such a way the least restrictive controllable supervisor is preserved. The method is based on variable abstraction, which involves the identification and removal of irrelevant variables from a model. Variable abstraction preserves controllability, and the paper shows how approximations can be used to ascertain least restrictiveness of the synthesis result. The approach has the modelling benefits of Extended Finite-state Automata, leads to optimal control solutions, and reduces the synthesis cost. An example of a manufacturing system illustrates the contributions.
      Date
      2013
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      ©2013 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 [1164]
      Show full item record  

      Usage

      Downloads, last 12 months
      12
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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