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.

      An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis

      Mohajerani, Sahar; Malik, Robi; Fabian, Martin
      Thumbnail
      Files
      An Algorithm.pdf
      140.0Kb
      DOI
       10.3182/20121003-3-MX-4033.00040
      Link
       www.ifac-papersonline.net
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R., & Fabian, M. (2012). An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis. In Proceedings of the 11th International Workshop on Discrete Event Systems (pp. 239-244).
      Permanent Research Commons link: https://hdl.handle.net/10289/8037
      Abstract
      This paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper describes the algorithm, adapted from known bisimulation equivalence algorithms, for the improved abstraction method. The algorithm has been implemented in the DES software tool Supremica and has been used to compute modular supervisors for several large benchmark examples. It successfully computes modular supervisors for systems with more than 1012 reachable states.
      Date
      2012
      Type
      Conference Contribution
      Publisher
      The international Federation of Automatic Control
      Rights
      © 2012 The international Federation of Automatic Control.
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

      Downloads, last 12 months
      42
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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