DocumentCode :
2107418
Title :
The logical complexity of control problems formulated in COCOLOG
Author :
Wei, Y.J. ; Caines, P.E.
Author_Institution :
Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada
fYear :
1993
fDate :
15-17 Dec 1993
Firstpage :
2303
Abstract :
The COCOLOG system is a partially ordered family of first order logical theories that describe the controlled evolution of the state of a given partially observed finite machine M. Following the review of the general COCOLOG system and its Markovain fragment system, a multi-complexity measurement called joint is defined and further a partial order simplicity is introduced. Finally, some comparisons among various control problems have been given
Keywords :
Markov processes; finite automata; finite state machines; formal logic; intelligent control; state estimation; COCOLOG system; Markovain fragment system; conditional controller; first order logical theories; joint index; logical complexity; multi-complexity measurement; observer logic; partial order simplicity; partially observed finite machine; state estimation axioms; state evolution; state transition; Arithmetic; Control systems; Iris; Logic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on
Conference_Location :
San Antonio, TX
Print_ISBN :
0-7803-1298-8
Type :
conf
DOI :
10.1109/CDC.1993.325608
Filename :
325608
Link To Document :
بازگشت