CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Certainly Unsupervisable States

S. Ware ; R.P. Malik ; Sahar Mohajerani (Institutionen för signaler och system, Automation) ; Martin Fabian (Institutionen för signaler och system, Automation)
2nd International Workshop of Formal Techniques for Safety-Critical Systems, FTSCS 2013; Queenstown; New Zealand; 29 October 2013 through 30 October 2013 Vol. 419 (2014), p. 280-296.
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2015-05-07. Senast ändrad 2016-02-01.
CPL Pubid: 216704


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation



Chalmers infrastruktur