DocumentCode
435134
Title
Finite automata approximations with error bounds for systems with quantized actuation and measurement: a case study
Author
Tarraf, Danielle C. ; Megretski, Alexandre ; Dahleh, Munther A.
Author_Institution
Dept. of Mech. Eng., Massachusetts Inst. of Technol., USA
Volume
2
fYear
2004
fDate
14-17 Dec. 2004
Firstpage
1436
Abstract
We consider stable, discrete time, first order LTI systems with finite input alphabets and quantized outputs. We propose an algorithm for generating deterministic finite state machine approximations of these systems with computable bounds on approximation error, and we describe the conditions under which the bounds are valid.
Keywords
approximation theory; deterministic automata; discrete time systems; finite state machines; linear systems; LTI systems; approximation error; deterministic finite state machine approximations; discrete time system; error bounds; finite automata approximations; finite input alphabets; measurement system; quantized actuation system; quantized outputs; stable system; Approximation algorithms; Approximation error; Automata; Automatic control; Computer aided software engineering; Control systems; Output feedback; Pervasive computing; State-space methods; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2004. CDC. 43rd IEEE Conference on
ISSN
0191-2216
Print_ISBN
0-7803-8682-5
Type
conf
DOI
10.1109/CDC.2004.1430245
Filename
1430245
Link To Document