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
      • Computer Science Working Paper Series
      • 2018 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2018 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Framework and proofs for synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction

      Malik, Robi; Teixeira, Marcelo
      Thumbnail
      Files
      uow-cs-wp-2018-03.pdf
      Published version, 549.2Kb
      Find in your library  
      Citation
      Export citation
      Malik, R., & Teixeira, M. (2018). Framework and proofs for synthesis of least restrictive controllable supervisors for extended finite-state machines with variable abstraction (Working paper No. 03/2018). Hamilton, New Zealand: Department of Computer Science, The University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/12140
      Abstract
      This working 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 working paper explains the theory of EFSM synthesis and abstraction and includes formal proofs of all results. An example of a flexible manufacturing system illustrates how the proposed algorithm works to compute a modular supervisor.
      Date
      2018
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      03/2018
      Publisher
      Department of Computer Science, The University of Waikato
      Rights
      © 2018 The Authors
      Collections
      • 2018 Working Papers [4]
      Show full item record  

      Usage

      Downloads, last 12 months
      24
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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