The complexity of diagnosability and opacity verification for Petri nets
type: Item
instance of: scholarly article
title: The complexity of diagnosability and opacity verification for Petri nets
zbMATH Open document ID: 1393.68111
DOI: 10.1007/978-3-319-57861-3_13
author: Béatrice Bérard
author: Stefan Haar
author: Sylvain Schmitz
author: Stefan Schwoon
publication date: 2018-08-20T00:00:00Z
full work available at URL: bhss-fi.pdf
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6920502
MaRDI profile type: Publication
OpenAlex ID: W2607928427
Recommended article: The Complexity of Diagnosability and Opacity Verification for Petri Nets
Recommended article: On the Decidability and Complexity of Diagnosability for Labeled Petri Nets
Recommended article: Decidability of opacity verification problems in labeled Petri net systems
Recommended article: Diagnosability of Petri nets with observation graphs
Recommended article: A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
Recommended article: The Diagnosability of Petri Net Models Using Minimal Explanations
Recommended article: Codiagnosability Analysis of Bounded Petri Nets
Recommended article: Corrections to “On the Decidability and Complexity of Diagnosability for Labeled Petri Nets” [Nov 17 5931-5938]
Recommended article: On-the-fly diagnosability analysis of bounded and unbounded labeled Petri nets using verifier nets
description: scientific article; zbMATH DE number 6920502