Certainly Unsupervisable States
Paper i proceeding, 2014

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.


S. Ware

University of Waikato

R. Malik

University of Waikato

Sahar Mohajerani

Signaler och system, System- och reglerteknik, Automation

Martin Fabian

Signaler och system, System- och reglerteknik, Automation

Communications in Computer and Information Science

1865-0929 (ISSN)

Vol. 419 280-296