کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
752520 895437 2011 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Generalized detectability for discrete event systems
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
Generalized detectability for discrete event systems
چکیده انگلیسی

In our previous work, we investigated detectability of discrete event systems, which is defined as the ability to determine the current and subsequent states of a system based on observation. For different applications, we defined four types of detectabilities: (weak) detectability, strong detectability, (weak) periodic detectability, and strong periodic detectability. In this paper, we extend our results in three aspects. (1) We extend detectability from deterministic systems to nondeterministic systems. Such a generalization is necessary because there are many systems that need to be modeled as nondeterministic discrete event systems. (2) We develop polynomial algorithms to check strong detectability. The previous algorithms are based on an observer whose construction is of exponential complexity, while the new algorithms are based on a new automaton called a detector. (3) We extend detectability to D-detectability. While detectability requires determining the exact state of a system, D-detectability relaxes this requirement by asking only to distinguish certain pairs of states. With these extensions, the theory on detectability of discrete event systems becomes more applicable in solving many practical problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Systems & Control Letters - Volume 60, Issue 5, May 2011, Pages 310–317
نویسندگان
, ,