A supervisory control algorithm based on property-directed reachability
Paper in proceedings, 2017

We present an algorithm for synthesising a controller (supervisor) for a discrete event system (DES) based on the property-directed reachability (PDR) model checking algorithm. The discrete event systems framework is useful in both software, automation and manufacturing, as problems from those domains can be modelled as discrete supervisory control problems. As a formal framework, DES is also similar to domains for which the field of formal methods for computer science has developed techniques and tools. In this paper, we attempt to marry the two by adapting PDR to the problem of controller synthesis. The resulting algorithm takes as input a transition system with forbidden states and uncontrollable transitions, and synthesises a safe and minimally-restrictive controller, correct-by-design. We also present an implementation along with experimental results, showing that the algorithm has potential as a part of the solution to the greater effort of formal supervisory controller synthesis and verification.

Symbolic transition system

Synthesis

Supervisory control

Discrete-event systems

Verification

Property-directed reachability

Author

Koen Lindström Claessen

Functional Programming

Jonatan Kilhamn

Formal Methods

Laura Kovacs

Formal Methods

Bengt Lennartson

Chalmers, Signals and Systems, Systems and control, Automation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10629 LNCS 115-130

Areas of Advance

Information and Communication Technology

Production

Subject Categories

Computer and Information Science

Robotics

DOI

10.1007/978-3-319-70389-3_8

ISBN

978-331970388-6

More information

Created

12/20/2017