On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets

DOI10.2478/amcs-2018-0019zbMath1396.93090OpenAlexW2884111137WikidataQ129498954 ScholiaQ129498954MaRDI QIDQ1784050

Ben Li, Armand Toguyéni, Manel Khlif-Bouassida

Publication date: 26 September 2018

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/amcs-2018-0019

zbMATH Keywords

fault diagnosisdiscrete event systemslabeled Petri netson-the-fly diagnosability analysisverifier nets

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Observability (93B07) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Hierarchical Model for Testing a Distributed Computer System ⋮ Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems

Uses Software

• STLplus

Cites Work

• Unnamed Item
• On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
• Parallel program schemata
• A Petri Net Diagnoser for Discrete Event Systems Modeled by Finite State Automata
• A polynomial algorithm for testing diagnosability of discrete-event systems
• Diagnosability of discrete-event systems
• An Efficient Approach for Online Diagnosis of Discrete Event Systems
• Polynomial-time verification of diagnosability of partially observed discrete-event systems
• Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets