SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Journal article, 2009

Satisfiability solving, the problem of deciding whether the variables of a propositional formula can be assigned in such a way that the formula evaluates to true, is one of the classic problems in computer science. It is of theoretical interest because it is the canonical NP-complete problem. It is of practical interest because modern SAT-solvers can be used to solve many important and practical problems. In this tutorial paper, we show briefly how such SAT-solvers are implemented, and point to some typical applications of them. Our aim is to provide sufficient information (much of it through the reference list) to kick-start researchers from new fields wishing to apply SAT-solvers to their problems. Supervisory control theory originated within the control community and is a framework for reasoning about a plant to be controlled and a specification that the closed-loop system must fulfil. This paper aims to bridge the gap between the computer science community and the control community by illustrating how SAT-based techniques can be used to solve some supervisory control related problems.

Formal verification

Model checking

Boolean satisfiability problem

Supervisory control

Author

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Niklas Een

Cadence Design Systems

Mary Sheeran

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Niklas Sörensson

University of Gothenburg

Alexey Voronov

Chalmers, Signals and Systems, Systems and control, Automation

Knut Åkesson

Chalmers, Signals and Systems, Systems and control, Automation

Discrete Event Dynamic Systems: Theory and Applications

0924-6703 (ISSN) 1573-7594 (eISSN)

Vol. 19 4 495-524

Areas of Advance

Information and Communication Technology

Production

Subject Categories

Computer Science

DOI

10.1007/s10626-009-0081-8

More information

Created

10/7/2017