A set theory based centralized diagnosability in discrete event systems

Basit Öğe Kaydı
dc.contributor.authorGhasamzadeh, M.
dc.contributor.authorShirmohammadi, M.
dc.date.accessioned2024-07-12T20:50:26Z
dc.date.available2024-07-12T20:50:26Z
dc.date.issued2009en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractThis paper addresses a new set theory based model of centralized diagnosability in discrete event systems. This research improves the efficiency of Sampaths approach as a reference framework. The proposed model meets the necessary and sufficient conditions of diagnosability and it benefits from ZBDD (Zero-suppressed Binary Decision Diagram ) in set theory representations. The CUDD - Colorado University Decision Diagrams package was used to implement the related algorithms, and we have also derived a formal proof which shows the superiority of the proposed method in space and time complexity to former existing methods. Mainly we address centralized diagnosability in discrete event systems (DESs). DESs have discrete states and events. By occurring a certain event, DESs’s state is changed. Diagnosability, first was introduced by [1] who considered its properties in the framework of DESs. In summary, the sequencing of events uses to determine whether a system is operating as desired or whether a failure may have occurred. A methodology for building DESs models for failure diagnosis is also provided and a model-based approach for detecting failure events using diagnosers is presented, which state necessary and sufficient conditions for a language to be diagnosed. Jiang [2] is one of the related research works. Then, the researchers like Yoo focused on polynomial tests of failure diagnosability [3], and such a new direction like timed discrete event systems where sequencing and timing of events are considered. After all decentralized and distributed diagnosability have been introduced. In these two latter concepts, there are more than one observer in large and distributed systems. If the observers do not speak with each other, the decentralized diagnosability is considered, and if they do speak each other, the distributed diagnosability is considered. Since Diagnosability is important in large complex systems, so it has been received considerable attentions in scientific and industrial literatures.en_US
dc.identifier.citationGhasemzadeh, M. ve Shirmohammadi, M. (2009). Maltepe Üniversitesi. s. 241.en_US
dc.identifier.endpage242en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage241en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2342
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07707
dc.titleA set theory based centralized diagnosability in discrete event systemsen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu