Initial state opacity in stochastic des

IEEE International Conference on Emerging Technologies and Factory Automation, ETFA

Volumn , Issue , 2013, Pages

  Keroglou, C ^a   Hadjicostis, C N ^a  

^a UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Initial state opacity; probabilistic automata; security and privacy

Indexed keywords

A-PRIORI PROBABILITIES; INITIAL STATE; NONDETERMINISTIC FINITE AUTOMATON; PROBABILISTIC AUTOMATA; PROBABILISTIC FINITE AUTOMATA; PSPACE-COMPLETE PROBLEMS; SECURITY AND PRIVACY; STOCHASTIC DISCRETE EVENT SYSTEMS;

FACTORY AUTOMATION; FINITE AUTOMATA; STOCHASTIC SYSTEMS;

OPACITY;

EID: 84890578248     PISSN: 19460740     EISSN: 19460759     Source Type: Conference Proceeding    
DOI: 10.1109/ETFA.2013.6648005     Document Type: Conference Paper

References (16)

1. E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud,and P. Darondeau. Concurrent secrets. In Proceedingsof the 8th International Workshop on Discrete EventSystems (WODES 2006), pages 51-57, 2006.
2. J. W. Bryans, M. Koutny, L. Mazare, and P. Ryan. Opacitygeneralised to transition systems. In Selected Papers of the3rd International Workshop on Formal Aspects in Securityand Trust, pages 421-435, 2005.
3. J. W. Bryans, M. Koutny, and P. Ryan. Modelling opacityusing Petri nets. Electron. Notes Theor. Comput. Sci.,121:101-115, Feb. 2005.
4. C. Cassandras and S. Lafortune. Introduction to DiscreteEvent Systems. Kluwer Academic Publishers, 1999.
5. J. Dubreil, P. Darondeau, and H. Marchand. Opacity enforcingcontrol synthesis. In Proceedings of 9th InternationalWorkshop on Discrete Event Systems, (WODES2008), pages 28-35, 2008.
6. R. Focardi and R. Gorrieri. A taxonomy of trace-based securityproperties for CCS. In Proceedings of the 7th Workshopon Computer Security Foundations, pages 126-136,1994.
7. D. Lee and M. Yannakakis. Testing finite-state machines:state identification and verification. IEEE Transactions onComputers, 43(3):306-320, 1994.
8. A. Saboori. Verification and Enforcement of State-BasedNotions of Opacity in Discrete Event Systems. PhD thesis,University of Illinois, Urbana, IL, 2010.
9. A. Saboori and C. N. Hadjicostis. Notions of security andopacity in discrete event systems. In Proceedings of 46thIEEE Conference on Decision and Control (CDC 2007),pages 5056-5061, 2007.
10. A. Saboori and C. N. Hadjicostis. Verification of initialstateopacity in security applications of DES. In Proceedingsof 9th International Workshop on Discrete Event Systems(WODES 2008), pages 328-333, 2008.
11. A. Saboori and C. N. Hadjicostis. Opacity verification instochastic discrete event systems. In Proceedings of 49thIEEE Conference on Decision and Control (CDC 2010),pages 6759-6764, 2010.
12. A. Saboori and C. N. Hadjicostis. Coverage analysisof mobile agent trajectory via state-based opacity formulations.Control Engineering Practice, 19(9):967-977,2011.
13. A. Saboori and C. N. Hadjicostis. Verification of K-stepopacity and analysis of its complexity. IEEE Transactionson Automation Science and Engineering, 8(3):549-559,2011.
14. A. Saboori and C. N. Hadjicostis. Verification of infinitestepopacity and complexity considerations. IEEE Transactionson Automatic Control, 57(5):1265-1269, 2012.
15. A. Saboori and C. N. Hadjicostis. Verification of initialstateopacity in security applications of DES. InformationSciences, 246:115-132, 2013.
16. S. Schneider and A. Sidiropoulos. CSP and anonymity. InProceedings of the 4th European Symposium on Researchin Computer Security, pages 198-218, 1996.