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.

      Yet another approach to compositional synthesis of discrete event systems

      Malik, Robi; Flordal, Hugo
      Thumbnail
      Files
      yet another approach to compositional synthesis.pdf
      134.6Kb
      DOI
       10.1109/WODES.2008.4605916
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Malik, R. & Flordal, H.(2008). Yet another approach to compositional synthesis of discrete event systems. In B. Lennartson, M. Fabian, K. Åkesson, A. Giua, R. Kumar (Eds), Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden, 28-30 May, 2008(pp.16-21). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/1990
      Abstract
      A two-pass algorithm for compositional synthesis of modular supervisors for large-scale systems of composed finite-state automata is proposed. The first pass provides an efficient method to determine whether a supervisory control problem has a solution, without explicitly constructing the synchronous composition of all components. If a solution exists, the second pass yields an over-approximation of the least restrictive solution which, if nonblocking, is a modular representation of the least restrictive supervisor. Using a new type of equivalence of nondeterministic processes, called synthesis equivalence, a wide range of abstractions can be employed to mitigate state-space explosion throughout the algorithm.
      Date
      2008
      Type
      Conference Contribution
      Publisher
      IEEE
      Rights
      This article has been published in the Proceedings of 9th International Workshop on Discrete Event Systems (WODES'08). IEEE, Göteborg, Sweden; 28-30 May, 2008. ©2008 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 severs 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 [1452]
      Show full item record  

      Usage

      Downloads, last 12 months
      74
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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