The complexity of diagnosability and opacity verification for Petri nets

DOI10.1007/978-3-319-57861-3_13MaRDI QIDQ1662539zbMATH OpenOpenAlexFDO

Authors Béatrice Bérard, Stefan Haar, Sylvain Schmitz, Stefan Schwoon

Publication date 20 August 2018

Full work available at URL https://hal.inria.fr/hal-01484476v2/file/bhss-fi.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The complexity of diagnosability and opacity verification for Petri nets
• On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
• Decidability of opacity verification problems in labeled Petri net systems
• Diagnosability of Petri nets with observation graphs
• A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
• The Diagnosability of Petri Net Models Using Minimal Explanations
• Codiagnosability Analysis of Bounded Petri Nets
• Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
• On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets

Cited in

(9)

• On the cost of diagnosis with disambiguation
• Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
• Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
• Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
• A notion of biological diagnosability inspired by the notion of opacity in systems security
• The complexity of diagnosability and opacity verification for Petri nets
• A general language-based framework for specifying and verifying notions of opacity
• Verification of opacity and diagnosability for pushdown systems
• scientific article; zbMATH DE number 7561325 (Why is no real title available?)

This page was built for publication: The complexity of diagnosability and opacity verification for Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662539)