Applications of the Fuzzy State Fuzzy Output Finite State Machine to the Problem of Recovery from Violation of Ontological Assumptions

• A programmable logic controller (PC) carries out a control algorithm under violations of theontological assumptions (VOA) when the plant does not meet one or more unstated but essential assumptions used in the design of the control algorithm. This paper presents a recovery technique based on the theory of Fuzzy State Fuzzy Output Finite State Machines (FSFO-FSM). The appeal of this approach is that the only known recovery results today are for fuzzy controllers. A common drawback of most linguistic models is that they are essentially static and thus not suitable to model the sequential behavior of a PC program. A FSFO-FSM can act as a sequentialmachine during the normal course of control, yet it possesses all the required linguistic properties during a VOA. This approach can enhance substantially the safety and operational range of existing PC and embedded control applications. This paper describes the control problem, presents results based on simulations, and show architectural constraints when applying this principle to real-world application.

Nyckelord

Fuzzy Control

Supervisory Control

Ontological Control

Fuzzy Logic

Process Control

Process

Algorithms; Computer simulation; Finite automata; Fuzzy control; Linguistics; Process control; Programmable logic controllers; SCADA systems; Sequential machines

Datateknik

Computer Engineering

Reglerteknik

Automatic Control

Publikations- och innehållstyp

ref (ämneskategori)

art (ämneskategori)