Computation of Min and Max Transition Times in Automata Representing Disctete-Event-Observed Continuous, Monotone Plants  

Oleh:

Preisig, Heinz A ; Lim, Khiang Wee ; Xi, Yunxia

Jenis: Article from Article
Dalam koleksi: Final Program and Book of Abstracts: The 4th Asian Control Conference, September 25-27, 2002 (Sep. 2002), page 1928-1933.
Topik: Min and Max Transition; Automata; Representing DiscreteContinuous; Monotone Plants
Fulltext: AC021658.PDF (179.35KB)

Isi artikel

Algorithms for the mapping of linear and nonlinear continuous plants that are discrete-event-observed and excited by dicrete-event signals into non deterministic automata have been developed and are now available [6]. The mapping does, though, loose all timing information. This information would be extremely useful for the design of the derived operational procedures such as supervisory controllers on all levels and fault detection and fault isolation schemes. Here we compute the minimal and maximal transition times for every possible transition.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali