COCOLOG: a conditional observer and controller logic for finite machines
- 1 January 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2845-2850 vol.5
- https://doi.org/10.1109/cdc.1990.203298
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
This publication has 5 references indexed in Scilit:
- Classical and logic based regulator design and its complexity for partially observed automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Dynamical logic observers for finite automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The intractability of resolutionTheoretical Computer Science, 1985
- Foundations of Logic ProgrammingPublished by Springer Nature ,1984
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965