On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
DOI10.2478/AMCS-2018-0019zbMATH Open1396.93090OpenAlexW2884111137WikidataQ129498954 ScholiaQ129498954MaRDI QIDQ1784050FDOQ1784050
Authors: Ben Li, Manel Khlif-Bouassida, Armand Toguyéni 
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
Recommendations
- Marking diagnosability verification in labeled Petri nets
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
- On-the-fly and incremental technique for fault diagnosis of discrete event systems modeled by labeled Petri nets
- Diagnosis of Petri Nets
- \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
discrete event systemsfault diagnosislabeled Petri netson-the-fly diagnosability analysisverifier nets
Observability (93B07) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Parallel program schemata
- A polynomial algorithm for testing diagnosability 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
- On \(\mathcal K\)-diagnosability of Petri nets via integer linear programming
- Diagnosability of discrete-event systems
- An Efficient Approach for Online Diagnosis 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
- A Petri Net Diagnoser for Discrete Event Systems Modeled by Finite State Automata
Cited In (11)
- \(K\)-diagnosability analysis of bounded and unbounded Petri nets using linear optimization
- Supervisor synthesis for asynchronous diagnosability enforcement in labeled Petri nets
- A semi-symbolic diagnoser for fault diagnosis of bounded labeled Petri nets
- Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems
- Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
- Marking diagnosability verification in labeled Petri nets
- The complexity of diagnosability and opacity verification for Petri nets
- Diagnosability enforcement in labeled Petri nets using supervisory control
- Diagnosability analysis of patterns on bounded labeled prioritized Petri nets
- On-the-fly and incremental technique for fault diagnosis of discrete event systems modeled by labeled Petri nets
- Hierarchical Model for Testing a Distributed Computer System
Uses Software
This page was built for publication: On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784050)
