Synthesis equivalence of triples

Mohajerani, Sahar; Malik, Robi; Fabian, Martin

Synthesis equivalence of triples

dc.contributor.author	Mohajerani, Sahar
dc.contributor.author	Malik, Robi
dc.contributor.author	Fabian, Martin
dc.date.accessioned	2013-02-08T03:02:16Z
dc.date.available	2013-02-08T03:02:16Z
dc.date.issued	2012-09-19
dc.description.abstract	This 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.mimetype	application/pdf
dc.identifier.citation	Mohajerani, 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.issn	1177-777X
dc.identifier.uri	https://hdl.handle.net/10289/7162
dc.language.iso	en
dc.publisher	University of Waikato, Department of Computer Science	en_NZ
dc.relation.ispartofseries	Computer Science Working Papers
dc.rights	© Sahar Mohajerani, Robi Malik, Martin Fabian	en_NZ
dc.subject	computer science	en_NZ
dc.title	Synthesis equivalence of triples	en_NZ
dc.type	Working Paper	en_NZ
uow.relation.series	04/2012