Supervisor Synthesis to Satisfy Safety and Reachability Requirements in Chemical Process Control

Abstract A specification expressed in computation tree logic (CTL) that enforces safety and reachability requirements in discrete event systems is proposed. It is shown that the specification has a unique minimal control strategy that maximizes the set of states that satisfy the specification, and an algorithm is provided to calculate the control strategy. The specification captures the idea that the chemical process should always be able to shut down in a safe manner. The algorithm uses established CTL model checking procedures to perform the intermediate calculations, and can incorporate symbolic model checking. The maximum problem size for which a control strategy can be calculated is similar to that of the corresponding verification problem. A small example demonstrates the application of the algorithm to a problem that includes safety and reachability constraints. Current work aims to use the techniques to solve a real process control problem supplied by industry.

[1]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[2]  I. Moon Modeling programmable logic controllers for logic verification , 1994, IEEE Control Systems.

[3]  Gary J. Powers,et al.  Verification of a logically controlled, solids transport system using symbolic model checking , 1997 .

[4]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[5]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[6]  Edmund M. Clarke,et al.  Automatic verification of sequential control systems using temporal logic , 1992 .

[7]  A. Morgenstern,et al.  Using Model Checking to Solve Supervisor Synthesis Problems , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  Shengbing Jiang,et al.  2080 SHENGBING JIANG AND RATNESH KUMAR , 2006 .

[9]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[10]  G. Stein,et al.  Respect the unstable , 2003 .

[11]  Jinkyung Kim,et al.  Model Checking for Automatic Verification of Control Logics in Chemical Processes , 2011 .

[12]  Raghunathan Rengaswamy,et al.  A review of process fault detection and diagnosis: Part II: Qualitative models and search strategies , 2003, Comput. Chem. Eng..

[13]  Klaus Schneider,et al.  Combining supervisor synthesis and model checking , 2005, TECS.

[14]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[15]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .