Authors:
Z. Fei
;
S. Miremadi
;
K. Åkesson
and
B. Lennartson
Affiliation:
Chalmers University of Technology, Sweden
Keyword(s):
Supervisory control theory, Deterministic finite automata, Symbolic representation, Reachability search, Propositional formula.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Formal Methods
;
Industrial Applications of AI
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Soft Computing
;
State Space Search
;
Symbolic Systems
Abstract:
The supervisory control theory (SCT) is a model-based framework which automatically synthesizes a supervisor that restricts a plant to be controlled based on specifications to be fulfilled. Two main problems typically encountered in industrial applications prevent SCT from having a major breakthrough. First, the supervisor which is synthesized automatically from the given plant and specification models might be incomprehensible to the users. To tackle this problem, in our previous work, an approach was presented to extract compact propositional formulae from the supervisor represented symbolically by binary decision diagrams (BDD) and attach them to the original models. However, this approach, which computes the supervisor symbolically in the conjunctive way, might lead to another problem: the state-space explosion, because of the large number of intermediate BDD nodes during computation. In this paper, we introduce an alternative approach to alleviate this problem, which is based on
the disjunctive partitioning technique including a set of selection heuristics. Then this approach is adapted to the guard generation procedure. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.
(More)