Synthesis observation equivalence and weak synthesis observation equivalence

dc.contributor.authorMohajerani, Sahar
dc.contributor.authorMalik, Robi
dc.contributor.authorFabian, Martin
dc.date.accessioned2012-08-15T03:15:33Z
dc.date.available2012-08-15T03:15:33Z
dc.date.issued2012-07-30
dc.description.abstractThis 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.en_NZ
dc.format.mimetypeapplication/pdf
dc.identifier.citationMohajerani, 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.en_NZ
dc.identifier.issn1177-777X
dc.identifier.urihttps://hdl.handle.net/10289/6585
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 observation equivalence and weak synthesis observation equivalenceen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series03/2012
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
uow-cs-wp-2012-03.pdf
Size:
217.24 KB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: