Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems

Discrete Event Dynamic Systems: Theory and Applications

Volumn 25, Issue 1-2, 2015, Pages 271-294

  Chédor, Sébastien ^a   Morvan, Christophe ^b   Pinchinat, Sophie ^a   Marchand, Hervé ^c  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITÉ GUSTAVE EIFFEL   (France)

^c INRIA   (France)

Author keywords

Diagnosability; Discrete event systems; Opacity; Recursive systems

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DISCRETE EVENT SIMULATION; FORMAL LANGUAGES;

DIAGNOSABILITY; INFINITE STATE SYSTEMS; INFORMATION FLOWS; OFF-LINE VERIFICATIONS; PARTIAL OBSERVATION; PUSHDOWN SYSTEMS; RECURSIVE STATE MACHINES; RUNTIME MONITORING;

OPACITY;

EID: 84926208791     PISSN: 09246703     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10626-014-0197-3     Document Type: Article

References (29)

1. Alur R, Etessami K, Yannakakis M (2001) Analysis of recursive state machines. In: CAV, vol 2102. LNCS, pp 207–220
2. Alur R, Madhusudan P (2004) Visibly pushdown languages. In: STOC 04. ACM, pp 202–211
3. Badouel E, Bednarczyk M, Borzyszkowski A, Caillaud B, Darondeau P (2007) Concurrent secrets. Discret Event Dyn Syst 17:425–446
4. Baldan P, Chatain T, Haar S, König B (2010) Unfolding-based diagnosis of systems with an evolving topology. Inf Comput 208(10):1169–1192. doi:10.1016/j.ic.2009.11.009
5. Bouyer P, Chevalier F, D’Souza D (2005) Fault diagnosis using timed automata. In: FoSSaCS’05, vol 3441. LNCS, Edinburgh, pp 219–233
6. Bryans J, Koutny M, Mazaré L, Ryan P Y A (2008) Opacity generalised to transition systems. Int J Inf Sec 7(6):421–435
7. Cassandras CG, Lafortune S (1999) Introduction to discrete event systems. Springer
8. Cassez F (2009) The dark side of timed opacity. In: Proceedings of the 3rd international conference on information security and assurance (ISA’09), vol 5576. LNCS, Seoul, pp 21–30
9. Cassez F, Dubreil J, Marchand H (2012) Synthesis of opaque systems with static and dynamic masks. Form 734Methods Syst Des 40(1):88–115
10. Caucal D (2007) Deterministic graph grammars. In: Texts in logics and games 2, pp 169–250
11. Caucal D, Hassen S (2008) Synchronization of grammars. In: Hirsch E, Razborov A, Semenov A, Slissenko A (eds) CSR, vol 5010. LNCS, Springer, pp 110–121
12. Chédor S, Jéron T, Morvan C (2013) Test generation from recursive tile systems. Rapport de recherche RR-8206, INRIA. http://hal.inria.fr/hal-00778134
13. Chédor S, Jéron T, Morvan C (2012) Test generation from recursive tiles systems. In: Brucker A, Julliand J (eds) 6th international conference on tests and proofs, vol 7305. LNCS, Prague, Czech Republic, pp 99–114. http://hal.inria.fr/hal-00743941, Prague, Czech Republic, p 99114
14. Courcelle B (1990) Handbook of theoretical computer science, chap. Graph rewriting: an algebraic and logic approach. Elsevier
15. Dubreil J, Jéron T, Marchand H (2009) Monitoring confidentiality by diagnosis techniques. In: ECC. Budapest, Hungary, pp 2584–2590
16. Hélouet L, Gazagnaire T, Genest B (2006) Diagnosis from scenarios. In: Proceedings of the 8th international workshop on discrete events systems, WODES’06, pp 307–312
17. Hélouet L, Marchand H, Genest B, Gazagnaire T (2013) Diagnosis from scenarios, and applications. Discrete Event Dynamic Systems, Theory and Applications
18. Jéron T, Marchand H, Pinchinat S, Cordier M O (2006) Supervision patterns in discrete event systems diagnosis. In: WODES’06, pp 262–268
19. Jiang S, Huang Z, Chandra V, Kumar R (2000) A polynomial algorithm for testing diagnosability of discrete event systems. IEEE Trans Autom Control 46: 1318–1321
20. Kobayashi K, Hiraishi K (2013) Verification of opacity and diagnosability for pushdown systems. Journal of Applied Mathematics
21. Morvan C, Pinchinat S (2009) Diagnosability of pushdown systems. In: HVC2009, Haifa verification conference, vol 6405. LNCS, Haifa, pp 21–33
22. Saboori A, Hadjicostis C (2008) Verification of initial-state opacity in security applications of des. In: 9th international workshop on discrete event systems, 2008. WODES 2008, pp 328–333
23. Saboori A., Hadjicostis C.N. (2012) Verification of infinite-step opacity and complexity considerations. IEEE Trans Automat Contr 57(5):1265–1269
24. Sampath M, Sengupta R, Lafortune S, Sinaamohideen K, Teneketzis D (1995) Diagnosability of discrete event systems. IEEE Trans Autom Control 40(9):1555–1575
25. Sampath M, Sengupta R, Lafortune S, Sinaamohideen K, Teneketzis D (1996) Failure diagnosis using discrete event models. IEEE Trans Control Syst Technol 4 (2): 105–124
26. Tripakis S (2002) Fault diagnosis for timed automata. In: Damm W, Olderog ER (eds) FTRTFT, vol 2469. LNCS, Springer, pp 205–224
27. Ushio T, Onishi I, Okuda K (1998) Fault detection based on petri net models with faulty behaviors. IEEE Int Conf Syst Man Cybernet 1(1):113–118
28. Wu YC, Lafortune S (2013) Comparative analysis of related notions of opacity in centralized and coordinated architectures. Discret Event Dyn Syst 23:307–339
29. Yoo TS, Lafortune S (2002) Polynomial-time verification of diagnosability of partially-observed discrete event systems. IEEE Trans Autom Control 47(3):1491–1495