Dynamic observers for the synthesis of opaque systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5799 LNCS, Issue , 2009, Pages 352-367

  Cassez, Franck ^a   Dubreil, Jérémy ^b   Marchand, Hervé ^b  

^a CSIRO   (Australia)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; COMPLETE PROBLEMS; DYNAMIC OBSERVERS; PARTIAL OBSERVABILITY; SYNTHESIS PROBLEMS;

SYNTHESIS (CHEMICAL);

EID: 71549125929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04761-9_26     Document Type: Conference Paper

References (22)

1. Lowe, G.: Towards a completeness result for model checking of security protocols. Journa of Computer Security 7(2-3), 89-146 (1999)
2. Blanchet, B., Abadi, M., Fournet, C.: Automated Verification of Selected Equivalences for Security Protocols. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), Chicago, IL, pp. 331-340. IEEE Computer Society, Los Alamitos (2005)
3. Hadj-Alouane, N., Lafrance, S., Lin, F., Mullins, J., Yeddes, M.: On the verification of intransitive noninterference in mulitlevel security. IEEE Transaction On Systems, Man, And Cybernetics-Part B: Cybernetics 35(5), 948-957 (2005)
4. Schneider, F.B.: Enforceable security policies. ACM Trans. Inf. Syst. Secur. 3(1), 30-50 (2000)
5. Ligatti, J., Bauer, L., Walker, D.: Edit automata: enforcement mechanisms for run-time security policies. Int. J. Inf. Sec. 4(1-2), 2-16 (2005)
6. Darmaillacq, V., Fernandez, J.C., Groz, R.,Mounier, L., Richier, J.L.: Test generation for network security rules. In: Uyar, M.Ü., Duale, A.Y., Fecko, M.A. (eds.) TestCom 2006. LNCS, vol. 3964, pp. 341-356. Springer, Heidelberg (2006)
7. Le Guernic, G.: Information flow testing - the third path towards confidentiality guarantee. In: Cervesato, I. (ed.) ASIAN 2007. LNCS, vol. 4846, pp. 33-47. Springer, Heidelberg (2007)
8. Dubreil, J., Jéron, T., Marchand, H.: Monitoring information flow by diagnosis techniques. Technical Report 1901, IRISA (August 2008)
9. Bryans, J., Koutny, M., Mazaré, L., Ryan, P.: Opacity generalised to transition systems. International Journal of Information Security 7(6), 421-435 (2008)
10. Alur, R., Černý, P., Zdancewic, S.: Preserving secrecy under refinement. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 107-118. Springer, Heidelberg (2006)
11. Badouel, E., Bednarczyk, M., Borzyszkowski, A., Caillaud, B., Darondeau, P.: Concurrent secrets. Discrete Event Dynamic Systems 17, 425-446 (2007)
12. Dubreil, J., Darondeau, P., Marchand, H.: Opacity enforcing control synthesis. In: Proceedings of the 9th International Workshop on Discrete Event Systems (WODES 2008), Göteborg, Sweden, May 2008, pp. 28-35 (2008)
13. Dubreil, J., Darondeau, P., Marchand, H.: Opacity enforcing control synthesis. Technical Report 1921, IRISA (February 2009)
14. Takai, S., Oka, Y.: A formula for the supremal controllable and opaque sublanguage arising in supervisory control. SICE Journal of Control, Measurement, and System Integration 1(4), 307-312 (2008)
15. Cassez, F., Tripakis, S.: Fault diagnosis with static or dynamic diagnosers. Fundamenta Informatica 88(4), 497-540 (2008)
16. Cassez, F., Dubreil, J., Marchand, H.: Dynamic Observers for the Synthesis of Opaque Systems. Technical Report 1930, IRISA (May 2009)
17. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: STOC, pp. 1-9. ACM, New York (1973)
18. Alur, R., Cerný, P., Chaudhuri, S.:Model checking on trees with path equivalences. In: Grumberg, O., Huth,M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 664-678. Springer, Heidelberg (2007)
19. Martin, D.A.: Borel determinacy. Annals of Mathematics 102(2), 363-371 (1975)
20. Thomas,W.: On the synthesis of strategies in infinite games. In:Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1-13. Springer, Heidelberg (1995), Invited talk
21. Karp, R.: A characterization of the minimum mean cycle in a digraph. Discrete Mathematics 23, 309-311 (1978)
22. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158(1-2), 343-359 (1996)