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
      • 2011 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2011 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Three variations of observation equivalence preserving synthesis abstraction

      Mohajerani, Sahar; Malik, Robi; Ware, Simon; Fabian, Martin
      Thumbnail
      Files
      uow-cs-wp-2011-01.pdf
      200.8Kb
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R., Ware, S. & Fabian, M. (2011). Three variations of observation equivalence preserving synthesis abstraction. (Working paper 01/2011). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/4974
      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-01-26
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      01/2011
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 2011 Working Papers [4]
      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