The complexity of diagnosability and opacity verification for Petri nets

DOI10.1007/978-3-319-57861-3_13zbMath1393.68111OpenAlexW2607928427MaRDI QIDQ1662539

Béatrice Bérard, Sylvain Schmitz, Stefan Haar, 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

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

Related Items

A general language-based framework for specifying and verifying notions of opacity, Unnamed Item