Open AccessApplication of the PCF calculus for solving the problem of nonblocking supervisory control of discrete event systems
Author(s) -
Artem Davydov,
Aleksandr Larionov,
Nadezhda Nagul
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1864/1/012048
Subject(s) - supervisor , supervisory control , inference , event (particle physics) , event calculus , representation (politics) , supervisory control theory , computer science , control (management) , logical analysis , logical framework , theoretical computer science , discrete event dynamic system , calculus (dental) , discrete system , control engineering , algorithm , mathematics , programming language , artificial intelligence , engineering , medicine , mathematical statistics , statistics , physics , dentistry , quantum mechanics , politics , political science , law
The paper provides a general view on the original logical inference based approach to dealing with discrete event systems as subject to supervisory control theory. The approach suggests a representation of discrete event system as a positively constructed formula to imply automated logical inference in the calculus of positively constructed formulas. During the inference, languages of the discrete event system are generated and analyzed. The minimally restricting supervisor for uncontrollable specification may be also designed. A nonblocking supervisor design is illustrated with a simplified model of autonomous underwater vehicle operational modes switching.