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.

      Five abstraction rules to remove transitions while preserving compositional synthesis results

      Mohajerani, Sahar; Malik, Robi; Fabian, Martin
      Thumbnail
      Files
      uow-cs-wp-2012-01.pdf
      247.7Kb
      Find in your library  
      Citation
      Export citation
      Mohajerani, S., Malik, R. & Fabian, M. (2012). Five abstraction rules to remove transitions while preserving compositional synthesis results (Working paper 01/2012). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/6259
      Abstract
      This working paper investigates under which conditions transitions can be removed from an automaton while preserving important synthesis properties. The work is part of a framework for compositional synthesis of least restrictive controllable and nonblocking supervisors for modular discrete event systems. The method for transition removal complements previous results, which are largely focused on state merging. Issues concerning transition removal in synthesis are discussed, and redirection maps are introduced to enable a supervisor to process an event, even though the corresponding transition is no longer present in the model. Based on the results, different techniques are proposed to remove controllable and uncontrollable transitions, and an example shows the potential of the method for practical problems.
      Date
      2012-03
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      01/2012
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 2012 Working Papers [4]
      Show full item record  

      Usage

      Downloads, last 12 months
      23
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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