Certainly Unsupervisable States

Ware, Simon; Malik, Robi; Mohajerani, Sahar; Fabian, Martin

doi:10.1007/978-3-319-05416-2_18

Files

ftscs2013.pdf

Accepted version, 167.4Kb

DOI

10.1007/978-3-319-05416-2_18

Citation

Export citation

Ware, 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_18

Permanent Research Commons link: https://hdl.handle.net/10289/9025

Abstract

This 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.

Date

2014

Type

Conference Contribution

Publisher

Springer International Publishing

Rights

This 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.

Collections

Computing and Mathematical Sciences Papers [1243]