暂无分享,去创建一个
[1] Maciej Koutny,et al. Opacity Generalised to Transition Systems , 2005, Formal Aspects in Security and Trust.
[2] Lijun Zhang,et al. Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata , 2014, IEEE Transactions on Automatic Control.
[3] Feng Lin,et al. Delayed Detectability of Discrete Event Systems , 2013, IEEE Transactions on Automatic Control.
[4] Hsu-Chun Yen,et al. A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..
[5] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[6] M. Hack,et al. PETRI NET LANGUAGE , 1976 .
[7] Alessandro Giua,et al. Observability of place/transition nets , 2002, IEEE Trans. Autom. Control..
[8] Alessandro Giua,et al. Weak (approximate) detectability of labeled Petri net systems with inhibitor arcs , 2018 .
[9] Jean-Jacques Lesage,et al. Overview of discrete event systems opacity: Models, validation, and quantification , 2016, Annu. Rev. Control..
[10] Alessandro Giua,et al. Decidability of opacity verification problems in labeled Petri net systems , 2017, Autom..
[11] Feng Lin,et al. Generalized detectability for discrete event systems , 2011, Syst. Control. Lett..
[12] Christoforos N. Hadjicostis,et al. Verification of Infinite-Step Opacity and Complexity Considerations , 2012, IEEE Transactions on Automatic Control.
[13] Christoforos Keroglou,et al. Detectability in stochastic discrete event systems , 2015, Syst. Control. Lett..
[14] Stéphane Lafortune,et al. On the Decidability and Complexity of Diagnosability for Labeled Petri Nets , 2017, IEEE Transactions on Automatic Control.
[15] Ettore Fornasini,et al. Observability, Reconstructibility and State Observers of Boolean Control Networks , 2013, IEEE Transactions on Automatic Control.
[16] Christoforos N. Hadjicostis,et al. Sensor Selection for Structural Observability in Discrete Event Systems Modeled by Petri Nets , 2010, IEEE Trans. Autom. Control..
[17] Kuize Zhang,et al. The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete , 2017, Autom..
[18] L. Dickson. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .
[19] Xiang Yin. Verification of Prognosability for Labeled Petri Nets , 2018, IEEE Transactions on Automatic Control.
[20] Christoforos N. Hadjicostis,et al. Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.
[21] Lijun Zhang,et al. A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks , 2015, SIAM J. Control. Optim..
[22] Mohamed Faouzi Atig,et al. On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..
[23] Xiang Yin,et al. Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures , 2017, Autom..
[24] Alessandro Giua,et al. A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets , 2012, IEEE Transactions on Automatic Control.
[25] Stéphane Lafortune,et al. Verification complexity of a class of observational properties for modular discrete events systems , 2017, Autom..
[26] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .
[27] Christoforos N. Hadjicostis,et al. Verification of initial-state opacity in security applications of discrete event systems , 2013, Inf. Sci..
[28] Daizhan Cheng,et al. Observability of Finite Labeled Transition Systems , 2018, IEEE Transactions on Automatic Control.
[29] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.
[30] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..
[31] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[32] Hong Yiguang,et al. Observability analysis and observer design for finite automata via matrix approach , 2013 .
[33] Charles Rackoff,et al. The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..
[34] Javier Esparza,et al. Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.
[35] Tomás Masopust,et al. Deciding Detectability for Labeled Petri Nets , 2018, Automatica.
[36] Tomás Masopust,et al. Complexity of Deciding Detectability in Discrete Event Systems , 2017, Autom..
[37] C. Reutenauer. The Mathematics of Petri Nets , 1990 .
[38] Christoforos N. Hadjicostis,et al. Verification of $K$-Step Opacity and Analysis of Its Complexity , 2009, IEEE Transactions on Automation Science and Engineering.
[39] Christoforos N. Hadjicostis,et al. Current-State Opacity Formulations in Probabilistic Finite Automata , 2014, IEEE Transactions on Automatic Control.