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.

      Transition removal for compositional supervisor synthesis

      Mohajerani, Sahar; Malik, Robi; Fabian, Martin
      Thumbnail
      Files
      case2012.pdf
      131.3Kb
      DOI
       10.1109/CoASE.2012.6386447
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R., & Fabian, M.(2012). Transition removal for compositional supervisor synthesis. In Proceedings of the IEEE International conference on Automation Science and Engineer(CASE), 20-24 August 2012, Seoul, South Korea (pp. 694-699). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/8092
      Abstract
      This paper investigates under which conditions transitions can be removed from an automaton while preserving important synthesis properties. The work is part of a framework for compositional synthesis of least restrictive controllable and nonblocking supervisors for modular discrete event systems. The method for transition removal complements previous results, which are largely focused on state merging. Issues concerning transition removal in synthesis are discussed, and redirection maps are introduced to enable a supervisor to process an event, even though the corresponding transition is no longer present in the model. Based on the results, different techniques are proposed to remove controllable and uncontrollable transitions, and an example shows the potential of the method for practical problems.
      Date
      2012
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      ©2012 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 [1385]
      Show full item record  

      Usage

      Downloads, last 12 months
      33
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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