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

      Synthesis observation equivalence and weak synthesis observation equivalence

      Mohajerani, Sahar; Malik, Robi; Fabian, Martin
      Thumbnail
      Files
      uow-cs-wp-2012-03.pdf
      217.2Kb
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R. & Fabian, M. (2012). Synthesis observation equivalence and weak synthesis observation equivalence. (Working paper 03/2012). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/6585
      Abstract
      This working paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper describes the algorithm, adapted from known bisimulation equivalence algorithms, for the improved abstraction method. The algorithm has been implemented in the DES software tool Supremica and has been used to compute modular supervisors for several large benchmark examples. It successfully computes modular supervisors for systems with more than 10¹² reachable states.
      Date
      2012-07-30
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      03/2012
      Publisher
      University of Waikato, Department of Computer Science
      Rights
      © Sahar Mohajerani, Robi Malik, Martin Fabian
      Collections
      • 2012 Working Papers [4]
      Show full item record  

      Usage

      Downloads, last 12 months
      26
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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