Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper an approach to on-line diagnosis of discrete event systems based on labeled Petri nets is presented. The approach is based on the notion of basis markings and justifications and it can be applied both to bounded and unbounded Petri nets whose unobservable subnet is acyclic. Moreover it is shown that, in the case of bounded Petri nets, the most burdensome part of the procedure may be...
In this paper we consider the brake system of a vehicle whose wheels are equipped with Anti-lock Braking Systems (ABS). We assume that the sensors that are responsible of the activation of the ABS are subject to faults. We first show how such a system can be modeled using labeled Petri nets and the notion of concurrent composition. Then, we show how fault diagnosis and diagnosability analysis can...
In this paper we present an approach to solve the problem of diagnosability of bounded Petri net systems. In particular, we first give necessary and sufficient conditions for diagnosability. Then, we present a method to test diagnosability that is based on the analysis of two graphs that depend on the structure of the net, including the faults model, and the initial marking. The first graph is called...
In this paper we consider the property of diagnosability for labeled unbounded Petri nets, namely Petri nets where the number of tokens in one or more places can grow indefinitely. We give necessary and sufficient conditions for diagnosability and we present a test to study diagnosability based on the analysis of the coverability graph of a particular net, called verifier net, that is built starting...
In this paper we study fault diagnosis of systems modeled by untimed continuous Petri nets. In particular, we generalize our previous works in this framework where we solved this problem only for special classes of continuous Petri nets, namely state machines and backward conflict free nets. We show that the price to pay for this generalization is that only three diagnosis states can be defined, rather...
Continuous Petri nets can be viewed as an approximation of the classical discrete models introduced to cope with the state explosion problem typical of discrete event systems. In this paper we consider free-labeled Petri net systems, and assume that certain transitions, including all those modeling faulty behaviors, are unobservable, i.e., they are labeled with the empty word. Based on the notion...
Most of the fault identification problems in the discrete event systems literature assume knowledge of the structure of the net system, including the nature (and behavior) of the possible faults. In this paper we deal with this problem within the framework of Petri nets by removing the requirement that the nature (and behavior) of the fault is known. In particular, we devise a way to identify the...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.