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.

      Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction

      Malik, Robi; Teixeira, Marcelo
      Thumbnail
      Files
      Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction.pdf
      360.2Kb
      DOI
       10.1007/s10626-019-00302-z
      Find in your library  
      Citation
      Export citation
      Malik, R., & Teixeira, M. (2020). Synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction. Discrete Event Dynamic Systems: Theory and Applications. https://doi.org/10.1007/s10626-019-00302-z
      Permanent Research Commons link: https://hdl.handle.net/10289/13638
      Abstract
      This paper presents an algorithm that combines modular synthesis for extended finite-state machines (EFSM) with abstraction of variables by symbolic manipulation, in order to compute least restrictive controllable supervisors. Given a modular EFSM system consisting of several components, the proposed algorithm synthesises a separate supervisor for each specification component. To synthesise each supervisor, the algorithm iteratively selects components (plants and variables) from a synchronous composition until a least restrictive controllable solution is obtained. This improves on previous results of the authors where abstraction is only performed by the selection of components and not variables. The paper explains the theory of EFSM synthesis and abstraction and its algorithms. An example of a flexible manufacturing system illustrates how the proposed algorithm works to compute a modular supervisor.
      Date
      2020
      Type
      Journal Article
      Publisher
      Springer
      Rights
      This is a post-peer-review, pre-copyedit version of an article published in Discrete Event Dynamic Systems: Theory and Applications. The final authenticated version is available online at: 10.1007/s10626-019-00302-z
      Collections
      • Computing and Mathematical Sciences Papers [1452]
      Show full item record  

      Usage

      Downloads, last 12 months
      84
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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