Show simple item record  

dc.contributor.authorMohajerani, Sahar
dc.contributor.authorMalik, Robi
dc.contributor.authorFabian, Martin
dc.date.accessioned2012-04-27T02:57:49Z
dc.date.available2012-04-27T02:57:49Z
dc.date.issued2012-03
dc.identifier.citationMohajerani, 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.en_NZ
dc.identifier.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/6259
dc.description.abstractThis 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.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_NZ
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_NZ
dc.titleFive abstraction rules to remove transitions while preserving compositional synthesis resultsen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series01/2012


Files in this item

This item appears in the following Collection(s)

Show simple item record