Show simple item record  

dc.contributor.authorMohajerani, Sahar
dc.contributor.authorMalik, Robi
dc.contributor.authorFabian, Martin
dc.date.accessioned2013-02-08T03:02:16Z
dc.date.available2013-02-08T03:02:16Z
dc.date.issued2012-09-19
dc.identifier.citationMohajerani, S., Malik, R. & Fabian, M. (2012). Synthesis equivalence of triples. (Working paper 04/2012). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_NZ
dc.identifier.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/7162
dc.description.abstractThis working paper describes a framework for compositional supervisor synthesis, which is applicable to all discrete event systems modelled as a set of deterministic automata. Compositional synthesis exploits the modular structure of the input model, and therefore works best for models consisting of a large number of small automata. State-space explosion is mitigated by the use of abstraction to simplify individual components, and the property of synthesis equivalence guarantees that the final synthesis result is the same as it would have been for the non-abstracted model. The working paper describes synthesis equivalent abstractions and shows their use in an algorithm to compute supervisors efficiently. The algorithm has been implemented in the DES software tool Supremica and successfully computes modular supervisors, even for systems with more than 1014 reachable states, in less than 30 seconds.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.rights© Sahar Mohajerani, Robi Malik, Martin Fabianen_NZ
dc.subjectcomputer scienceen_NZ
dc.titleSynthesis equivalence of triplesen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series04/2012


Files in this item

This item appears in the following Collection(s)

Show simple item record