کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
753039 | 1462338 | 2007 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions](/preview/png/753039.png)
چکیده انگلیسی
This paper presents a new algorithm for efficiently calculating pairs of indistinguishable states in finite-state automata with partially observable transitions. The need to obtain pairs of indistinguishable states occurs in several classes of problems related to control under partial observation, diagnosis, or distributed control with communication for discrete event systems. The algorithm obtains all indistinguishable state pairs in polynomial time in the number of states and events in the system. Another feature of the algorithm is the grouping of states into clusters and the identification of indistinguishable cluster pairs. Clusters can be employed to solve control problems for partially observed systems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Systems & Control Letters - Volume 56, Issues 9–10, September–October 2007, Pages 656–661
Journal: Systems & Control Letters - Volume 56, Issues 9–10, September–October 2007, Pages 656–661
نویسندگان
Weilin Wang, Stéphane Lafortune, Feng Lin,