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.

      On the use of observation equivalence in synthesis abstraction

      Mohajerani, Sahar; Malik, Robi; Ware, Simon; Fabian, Martin
      Thumbnail
      Files
      dcds2011.pdf
      130.3Kb
      DOI
       10.1109/DCDS.2011.5970323
      Link
       ieeexplore.ieee.org
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R., Ware S. & Fabien, M. (2011). On the use of observation equivalence in synthesis abstraction. In 2011 3rd International Workshop on Dependable Control of Discrete Systems (DCDS), 15-17 June 2011, Saarbrucken (pp. 84-89). Washington, DC, USA: IEEE.
      Permanent Research Commons link: https://hdl.handle.net/10289/5761
      Abstract
      In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata. In the current paper, observation equivalence is studied in relation to synthesis abstraction. It is shown that general observation equivalence is not useful for synthesis abstraction. Instead, we introduce additional conditions strengthening observation equivalence, so that it can be used with the compositional synthesis method. The paper concludes with an example showing the suitability of these relations to achieve substantial state reduction while computing a modular supervisor.
      Date
      2011
      Type
      Journal Article
      Publisher
      IEEE
      Rights
      © 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      58
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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