Show simple item record  

dc.contributor.authorWare, Simon
dc.contributor.authorMalik, Robi
dc.contributor.authorMohajerani, Sahar
dc.contributor.authorFabian, Martin
dc.contributor.editorArtho, C
dc.contributor.editorÖlveczky, PC
dc.coverage.spatialQueenstown, NZ
dc.date.accessioned2014-12-17T22:35:32Z
dc.date.available2014
dc.date.available2014-12-17T22:35:32Z
dc.date.issued2014
dc.identifierhttp://dx.doi.org/10.1007/978-3-319-05416-2_18
dc.identifier.citationWare, S., Malik, R., Mohajerani, S., & Fabian, M. (2014). Certainly Unsupervisable States. In C. Artho & P. Ölveczky (Eds.), Proceedings of the Second International Workshop on Formal Techniques for Safety-Critical Systems, Queenstown, NZ, October 29-30, 2013(Vol. CCIS 419, pp. 280–296). Springer International Publishing. http://doi.org/10.1007/978-3-319-05416-2_18en
dc.identifier.isbn3-319-05415-5
dc.identifier.isbn978-3-319-05415-5
dc.identifier.urihttps://hdl.handle.net/10289/9025
dc.description.abstractThis paper proposes an abstraction method for compositional synthesis. Synthesis is a method to automatically compute a control program or supervisor that restricts the behaviour of a given system to ensure safety and liveness. Compositional synthesis uses repeated abstraction and simplification to combat the state-space explosion problem for large systems. The abstraction method proposed in this paper finds and removes the so-called certainly unsupervisable states. By removing these states at an early stage, the final state space can be reduced substantially. The paper describes an algorithm with cubic time complexity to compute the largest possible set of removable states. A practical example demonstrates the feasibility of the method to solve real-world problems.
dc.format.extent280 - 296
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherSpringer International Publishing
dc.rightsThis is an author’s accepted version of a paper published in the Proceedings of the Second International Workshop on Formal Techniques for Safety-Critical Systems. © 2013 Springer International Publishing.
dc.sourceFTSCS 2013
dc.titleCertainly Unsupervisable States
dc.typeConference Contribution
dc.identifier.doi10.1007/978-3-319-05416-2_18
dc.relation.isPartOfProceedings of the Second International Workshop on Formal Techniques for Safety-Critical Systems
pubs.begin-page280
pubs.declined2014-08-14T20:27:47.551+1200
pubs.deleted2014-08-14T20:27:47.551+1200
pubs.elements-id82072
pubs.end-page296
pubs.volumeCCIS 419


Files in this item

This item appears in the following Collection(s)

Show simple item record