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.

      Compositional synthesis of discrete event systems using synthesis abstraction

      Mohajerani, Sahar; Malik, Robi; Ware, Simon; Fabian, Martin
      DOI
       10.1109/CCDC.2011.5968439
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R., Ware, S. & Fabian, M. (2011). Compositional synthesis of discrete event systems using synthesis abstraction. In Proceedings of 2011 Chinese Control and Decision Conference (CCDC), Mianyang, China (pp. 1549-1554). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/5764
      Abstract
      This paper proposes a general method to synthesize a least restrictive supervisor for a large discrete event system model, consisting of a large number of arbitrary automata representing the plants and specifications. A new type of abstraction called synthesis abstraction is introduced and three rules are proposed to calculate an abstraction of a given automaton. Furthermore, a compositional algorithm for synthesizing a supervisor for large-scale systems of composed finite-state automata is proposed. In the proposed algorithm, the synchronous composition is computed step by step and intermediate results are simplified according to synthesis abstraction. Then a supervisor for the abstracted system is calculated, which in combination with the original system gives the least restrictive, nonblocking, and controllable behaviour.
      Date
      2011
      Type
      Conference Contribution
      Publisher
      IEEE
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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