Verification of infinite-step opacity and analysis of its complexity

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 2, Issue PART 1, 2009, Pages 46-51

  Saboori, Anooshiravan ^a   Hadjicostis, Christoforos N ^a,b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Discrete event systems; Finite automata; Information flow; State estimation; System security

Indexed keywords

FINITE AUTOMATA; OPACITY; ROBOTS; STATE ESTIMATION;

HARD PROBLEMS; INFORMATION FLOWS; PARTIAL OBSERVATION; STATE ESTIMATORS; SYSTEM MODELING; SYSTEM OPERATION; SYSTEM SECURITY; SYSTEM STATE;

DISCRETE EVENT SIMULATION;

EID: 79960938668     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20090610-3-it-4004.00013     Document Type: Conference Paper

References (15)

1. Badouel, E., Bednarczyk,M., Borzyszkowski, A., Caillaud, B., and Darondeau, Ph. (2007). Concurrent secrets. Discrete Event Dynamic Systems, 17(4), 425-446. (Pubitemid 350074185)
2. Bryans, J.W., Koutny, M., and Ryan, P.Y.A. (2005a). Modelling opacity using Petri nets. Electronic Notes in Theoretical Computer Science, 121, 101-115. (Pubitemid 40219705)
3. Bryans, J., Koutny, M., Mazare, L., and Ryan, P. (2005b). Opacity generalised to transition systems. In Proc. Of the 3rd International Workshop on Formal Aspects in Security and Trust, 81-95. (Pubitemid 43971659)
4. Caines, P.E., Greiner, R., and Wang, S. (1991). Classical and logic-based dynamic observers for finite automata. IMA Journal of Mathematical Control and Information, 8(1), 45-80. (Pubitemid 21730305)
5. Cassandras, C. and Lafortune, S. (1999). Introduction to Discrete Event Systems. Kluwer Academic Publishers.
6. Dubreil, J., Darondeau, Ph., and Marchand, H. (2008). Opacity enforcing control synthesis. In Proc. of the 9th International Workshop on Discrete Event Systems, 28-35.
7. Focardi, R. and Gorrieri, R. (1994). A taxonomy of trace-based security properties for CCS. In Proc. of the 7th Workshop on Computer Security Foundations, 126-136.
8. Garey, M.R. and Johnson, D.S. (1979). Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman.
9. Kao, J.Y., Malton, A.J., Rampersad, N., and Shallit, J. (2008). On NFAs where all states are final, initial, or both. CoRR, abs/0808.2417. URL http://arxiv.org/abs/0808.2417.
10. Kleene, S.C. (1956). Representation of events in nerve nets and finite automata. In C.E. Shannon and M. McCarthy (eds.), Automata Studies, 34, 3-41. Princeton University Press.
11. Saboori, A. and Hadjicostis, C.N. (2007a). Delayed state estimation in discrete event systems and its application to security problems. Technical Report UILU-ENG-08-2204, University of Illinois at Urbana-Champaign.
12. Saboori, A. and Hadjicostis, C.N. (2007b). Notions of security and opacity in discrete event systems. In Proc. of the 46th IEEE Conference on Decision and Control, 5056-5061. (Pubitemid 351277942)
13. Saboori, A. and Hadjicostis, C.N. (2008). Verification of initial-state opacity in security applications of DES. In Proc. of the 9th International Workshop on Discrete Event Systems, 328-333.
14. Schneider, S. and Sidiropoulos, A. (1996). CSP and anonymity. In Proc. of the 4th European Symposium on Research in Computer Security, 198-218. (Pubitemid 126128903)
15. Wonham, W. (2005). Supervisory Control of Discrete-Event Systems. Systems and Control Group, Department of Electrical and Computer Engineering, University of Toronto. Available at www.utoronto.ca/DES.