The Complexity of Diagnosability and Opacity Verification for Petri Nets

Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues.

[1]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[2]  Stefan Haar.  What topology tells us about diagnosability in partial order semantics , 2012, Discret. Event Dyn. Syst..

[3]  Petr Jancar,et al.  Nonprimitive recursive complexity and undecidability for Petri net equivalences , 2001, Theor. Comput. Sci..

[4]  Sylvain Schmitz,et al.  Demystifying Reachability in Vector Addition Systems , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

[5]  Victor Khomenko,et al.  Diagnosability verification with parallel LTL-X model checking based on Petri net unfoldings , 2010, 2010 Conference on Control and Fault-Tolerant Systems (SysTol).

[6]  Benoît Caillaud,et al.  Concurrent Secrets , 2007, 2006 8th International Workshop on Discrete Event Systems.

[7]  Hervé Marchand,et al.  Dynamic Observers for the Synthesis of Opaque Systems , 2009, ATVA.

[8]  Hsu-Chun Yen,et al.  A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets , 1991, Theor. Comput. Sci..

[9]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[10]  Mikolaj Bojanczyk.  Automata column , 2014, SIGL.

[11]  Stéphane Lafortune,et al.  Polynomial-time verification of diagnosability of partially observed discrete-event systems , 2002, IEEE Trans. Autom. Control..

[12]  Alessandro Giua,et al.  A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets , 2012, IEEE Transactions on Automatic Control.

[13]  Feng Lin,et al.  Opacity of discrete event systems and its applications , 2011, Autom..

[14]  Sylvain Schmitz,et al.  The complexity of reachability in vector addition systems , 2016, SIGL.

[15]  Stefan Haar.  Types of Asynchronous Diagnosability and the Reveals-Relation in Occurrence Nets , 2010, IEEE Transactions on Automatic Control.

[16]  Stefan Haar,et al.  Reveal Your Faults: It's Only Fair! , 2013, 2013 13th International Conference on Application of Concurrency to System Design.

[17]  Alain J. Mayer,et al.  The Complexity of Word Problems - This Time with Interleaving , 1994, Inf. Comput..

[18]  Victor Khomenko,et al.  Diagnosability under Weak Fairness , 2014, 2014 14th International Conference on Application of Concurrency to System Design.

[19]  Peter Habermehl.  On the Complexity of the Linear-Time mu -calculus for Petri-Nets , 1997, ICATPN.

[20]  Petr Jancar,et al.  Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..

[21]  Alessandro Giua,et al.  Verification of initial-state opacity in Petri nets , 2015, 2015 54th IEEE Conference on Decision and Control (CDC).

[22]  Maciej Koutny,et al.  Opacity generalised to transition systems , 2005, International Journal of Information Security.

[23]  Shimon Even.  On Information Lossless Automata of Finite Order , 1965, IEEE Trans. Electron. Comput..

[24]  Stefan Haar.  Qualitative diagnosability of labeled petri nets revisited , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[25]  Raja Sengupta,et al.  Diagnosability of discrete-event systems , 1995, IEEE Trans. Autom. Control..

[26]  Shengbing Jiang,et al.  A polynomial algorithm for testing diagnosability of discrete-event systems , 2001, IEEE Trans. Autom. Control..

[27]  Walter Vogler.  Fairness and Partial Order Semantics , 1995, Inf. Process. Lett..