Verification of fault-predictability in labeled petri nets using predictor graphs

You D.;Seatzu C.
2019-01-01

Abstract

A fault-predictable discrete event system (DES) is a system where any fault can be correctly predicted before its occurrence. This paper studies the verification of fault-predictability in bounded and unbounded DESs modeled by labeled Petri nets (PNs). An approach based on the construction of a Predictor Net and a Predictor Graph (PG) is proposed. In particular, a necessary and sufficient condition for fault-predictability is derived by characterizing the structure of the PG. Furthermore, two rules are proposed to reduce the size of a given PN, which allows one to analyze the fault-predictability of the original net by verifying the fault-predictability of the reduced net.
2019
Inglese
64
10
8633388
4353
4360
8
Esperti anonimi
scientifica
Discrete event systems (DES)
Fault-predictability
Petri nets (PN)
You, D.; Wang, S. G.; Seatzu, C.
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
3
none
Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie