COCOLOG: a conditional observer and controller logic for finite machines

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.<>