Verification and enforcement of state-based notions of opacity in discrete event systems

[1]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  J. Meditch.  A survey of data smoothing for linear and nonlinear dynamic systems , 1973 .

[4]  Harry B. Hunt,et al.  On the time and tape complexity of languages I , 1973, STOC.

[5]  D. E. Bell,et al.  Secure Computer Systems : Mathematical Foundations , 2022 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Donald Reid.  An algorithm for tracking multiple targets , 1978 .

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[9]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[10]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[11]  R. Greiner,et al.  Dynamical logic observers for finite automata , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[12]  Walter Murray Wonham,et al.  On observability of discrete-event systems , 1988, Inf. Sci..

[13]  R. D. Brandt,et al.  Formulas for calculating supremal controllable and normal sublanguages , 1990 .

[14]  A. Willsky,et al.  Observability of discrete event dynamic systems , 1990 .

[15]  Panos J. Antsaklis,et al.  Stability and stabilizability of discrete event dynamic systems , 1991, JACM.

[16]  Peter E. Caines,et al.  Classical and Logic-Based Dynamic Observers for Finite Automata , 1991 .

[17]  Alan S. Willsky,et al.  Mathematics of Control, Signals, and Systems Invertibility of Discrete-event Dynamic Systems* , 2022 .

[18]  Roberto Gorrieri,et al.  A taxonomy of trace-based security properties for CCS , 1994, Proceedings The Computer Security Foundations Workshop VII.

[19]  David Lee,et al.  Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.

[20]  Amit Patra,et al.  On observability with delay: antitheses and syntheses , 1994, IEEE Trans. Autom. Control..

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

[22]  Yakov Bar-Shalom,et al.  Multitarget-Multisensor Tracking: Principles and Techniques , 1995 .

[23]  Steve A. Schneider,et al.  CSP and Anonymity , 1996, ESORICS.

[24]  Stéphane Lafortune,et al.  Failure diagnosis using discrete-event models , 1996, IEEE Trans. Control. Syst. Technol..

[25]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[26]  Sagar Naik,et al.  Efficient computation of unique input/output sequences in finite-state machines , 1997, TNET.

[27]  Demosthenis Teneketzis,et al.  Active diagnosis of discrete-event systems , 1998 .

[28]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[29]  Dhiraj K. Pradhan,et al.  GLFSR-a new test pattern generator for built-in-self-test , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[30]  Christos G. Cassandras,et al.  Introduction to Discrete Event Systems , 1999, The Kluwer International Series on Discrete Event Dynamic Systems.

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

[32]  Stéphane Lafortune,et al.  On an Optimization Problem in Sensor Selection* , 2002, Discret. Event Dyn. Syst..

[33]  Matt Bishop,et al.  Computer Security: Art and Science , 2002 .

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

[35]  Stéphane Lafortune,et al.  NP-completeness of sensor selection problems arising in partially observed discrete-event systems , 2002, IEEE Trans. Autom. Control..

[36]  Biplab Sikdar,et al.  A protocol for tracking mobile targets using sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[37]  Shengbing Jiang,et al.  Optimal sensor selection for discrete-event systems with partial observation , 2003, IEEE Trans. Autom. Control..

[38]  Shahin Hashtrudi-Zad,et al.  Fault diagnosis in discrete-event systems: framework and model reduction , 2003, IEEE Trans. Autom. Control..

[39]  Inseok Hwang,et al.  Immediate observability of discrete event systems with application to user-interface design , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[40]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[41]  Maciej Koutny,et al.  Modelling Dynamic Opacity Using Petri Nets with Silent Actions , 2004, Formal Aspects in Security and Trust.

[42]  Gaurav S. Sukhatme,et al.  Constrained coverage for mobile sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[43]  Maciej Koutny,et al.  Modelling Opacity Using Petri Nets , 2005, WISP@ICATPN.

[44]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[45]  Nejib Ben Hadj-Alouane,et al.  On the verification of intransitive noninterference in mulitlevel security , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[46]  D. Thorsley,et al.  Intrusion Detection in Controlled Discrete Event Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

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

[48]  Radha Poovendran,et al.  Stochastic coverage in heterogeneous sensor networks , 2006, TOSN.

[49]  Olivier Roux,et al.  Synthesis of non-interferent distributed systems , 2007 .

[50]  Christoforos N. Hadjicostis,et al.  Notions of security and opacity in discrete event systems , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[52]  A. Saboori,et al.  Verification of initial-state opacity in security applications of DES , 2008, 2008 9th International Workshop on Discrete Event Systems.

[53]  George Cybenko,et al.  The theory of trackability with applications to sensor networks , 2008, TOSN.

[54]  P. Darondeau,et al.  Opacity enforcing control synthesis , 2008, 2008 9th International Workshop on Discrete Event Systems.

[55]  Christoforos N. Hadjicostis,et al.  Verification of Infinite-Step Opacity and Analysis of its Complexity* , 2009 .

[56]  Sheng Zhong,et al.  k-Anonymous data collection , 2009, Inf. Sci..

[57]  Narad Rampersad,et al.  On NFAs where all states are final, initial, or both , 2008, Theor. Comput. Sci..

[58]  Christoforos N. Hadjicostis,et al.  Reduced-complexity verification for initial-state opacity in modular discrete event systems , 2010, WODES.

[59]  Christoforos N. Hadjicostis,et al.  Verification of $K$-Step Opacity and Analysis of Its Complexity , 2009, IEEE Transactions on Automation Science and Engineering.