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
      • 2008 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2008 Working 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 via synthesis equivalence

      Malik, Robi; Flordal, Hugo
      Thumbnail
      Files
      uow-cs-wp-2008-05.pdf
      195.4Kb
      Find in your library  
      Citation
      Export citation
      Malik, R. & Flordal, H. (2008). Compositional synthesis of discrete event systems via synthesis equivalence. (Working paper 05/2008). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/801
      Abstract
      A two-pass algorithm for compositional synthesis of modular supervisors for largescale 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-05-12
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      05/2008
      Publisher
      Department of Computer Science, University of Waikato
      Collections
      • 2008 Working Papers [14]
      Show full item record  

      Usage

      Downloads, last 12 months
      29
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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