COCOLOG: a conditional observer and controller logic for finite machines

Author

Caines, Peter E. ; Wang, Suning

Author_Institution

McGill Univ., Montreal, Que., Canada

fYear

1990

fDate

5-7 Dec 1990

Firstpage

2845

Abstract

The acronym COCOLOG is used to denote the family of first order conditional observer and controller logics for any given input-state-output system. A semantics is supplied for each COCOLOG in terms of interpretation of controlled transitions on a tree of state estimate sets indexed by observation o(k). Extra-logical rules relating members of family logics of a COCOLOG are then presented in the form of meta-level axioms and inference rules. Consistency and completeness of the first order theories in a COCOLOG family are established, and examples of the operation of a COCOLOG logic control system are given. Finally, comparisons of the features of flexibility and complexity issues of logic-based and classical control systems are addressed, and mention is made of mechanical theorem proving in COCOLOG

Keywords

digital control; finite automata; formal logic; inference mechanisms; state estimation; trees (mathematics); COCOLOG; conditional observer and controller logic; finite machines; inference; input-state-output system; logic control system; mechanical theorem proving; meta-level axioms; semantics; state estimate; tree; Adaptive control; Control systems; Logic design; Observers; State estimation;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1990., Proceedings of the 29th IEEE Conference on

Conference_Location

Honolulu, HI

Type

conf

DOI

10.1109/CDC.1990.203298

Filename

203298