A. Aho, Indexed Grammars---An Extension of Context-Free Grammars, Journal of the ACM, vol.15, issue.4, pp.647-671, 1968.
DOI : 10.1145/321479.321488

A. Aho, Nested Stack Automata, Journal of the ACM, vol.16, issue.3, pp.383-406, 1969.
DOI : 10.1145/321526.321529

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, K. Etessami, and M. Yannakakis, Analysis of recursive state machines, CAV, pp.207-220, 2001.

R. Alur, L. Fix, and T. A. Henzinger, Event-clock automata: a determinizable class of timed automata, Theoretical Computer Science, vol.211, issue.1-2, pp.253-273, 1999.
DOI : 10.1016/S0304-3975(97)00173-4

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390

J. Autebert, J. Berstel, and L. Boasson, Context-Free Languages and Pushdown Automata, Handbook of formal languages, pp.111-174, 1997.
DOI : 10.1007/978-3-642-59136-5_3
URL : https://hal.archives-ouvertes.fr/hal-00620669

E. Badouel, M. Bednarczyk, A. Borzyszkowski, B. Caillaud, and P. Darondeau, Concurrent secrets. Discrete Event Dynamic Systems, pp.425-446, 2007.
DOI : 10.1109/wodes.2006.1678407
URL : https://hal.archives-ouvertes.fr/inria-00070249

P. Baldan, . Th, S. Chatain, B. Haar, and . König, Unfolding-based diagnosis of systems with an evolving topology, Information and Computation, vol.208, issue.10, pp.1169-1192, 2010.
DOI : 10.1016/j.ic.2009.11.009
URL : https://hal.archives-ouvertes.fr/inria-00638204

B. Bérard, J. Mullins, and M. Sassolas, Quantifying opacity, QEST, pp.263-272, 2010.

N. Bertrand, T. Jéron, A. Stainer, and M. Krichen, Off-line test selection with test purposes for non-deterministic timed automata, Logical Methods in Computer Science, vol.8, issue.4, p.2012
DOI : 10.1007/978-3-642-19835-9_10
URL : https://hal.archives-ouvertes.fr/inria-00550923

N. Bertrand and C. Morvan, Probabilistic regular graphs, 12th International Workshop on Verification of Infinite-State Systems, pp.77-90, 2010.
DOI : 10.4204/EPTCS.39.6
URL : https://hal.archives-ouvertes.fr/inria-00525388

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, CONCUR : 8th International Conference on Concurrency Theory, pp.135-150, 1997.
DOI : 10.1007/3-540-63141-0_10

P. Bouyer, F. Chevalier, and D. Souza, Fault Diagnosis Using Timed Automata, FoSSaCS'05), pp.219-233, 2005.
DOI : 10.1007/978-3-540-31982-5_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7570

E. Brinskma, A. Alderen, R. Langerak, J. Van-de-laagemat, and J. Tretmans, A formal approach to conformance testing, Protocol Specification, Testing and Verification (PSTV'90), pp.349-363, 1990.

J. Bryans, M. Koutny, L. Mazaré, and P. Y. Ryan, Opacity generalised to transition systems, International Journal of Information Security, vol.79, issue.3???4, pp.421-435, 2008.
DOI : 10.1007/s10207-008-0058-x

A. Carayol and S. Wöhrle, The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata, FSTTCS 03, pp.112-123, 2003.
DOI : 10.1007/978-3-540-24597-1_10

C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, 1999.

F. Cassez, The Dark Side of Timed Opacity, Proc. of the 3rd International Conference on Information Security and Assurance (ISA'09), pp.21-30, 2009.
DOI : 10.1016/j.jss.2005.12.021
URL : https://hal.archives-ouvertes.fr/inria-00493635

D. Caucal and S. Hassen, Synchronization of Grammars, LNCS, vol.5010, pp.110-121, 2008.
DOI : 10.1007/978-3-540-79709-8_14
URL : https://hal.archives-ouvertes.fr/hal-00620185

S. Chédor, C. Jéron, and . Morvan, Test generation from recursive tiles systems, 6th International Conference on Tests and Proofs, pp.99-114, 2012.

S. Chédor, C. Jéron, and . Morvan, Test generation from recursive tile systems, Journal on Software Testing, 2013.

S. Chédor, C. Morvan, S. Pinchinat, and H. Marchand, Analysis of partially observed recursive tile systems, 11th edition of Workshop on Discrete Event Systems, pp.265-271, 2012.
DOI : 10.3182/20121003-3-MX-4033.00044

S. Chédor, C. Morvan, S. Pinchinat, and H. Marchand, Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems. Discrete Event Dynamic Systems, Article accepté, 2013.

C. Constant, B. Jeannet, and T. Jéron, Automatic Test Generation from Interprocedural Specifications, TestCom/FATES'07, pp.41-57, 2007.
DOI : 10.1007/978-3-540-73066-8_4
URL : https://hal.archives-ouvertes.fr/inria-00137064

B. Courcelle, J. Dubreil, T. Jéron, and H. Marchand, Handbook of Theoretical Computer Science, chapter Graph rewriting : an algebraic and logic approach Monitoring confidentiality by diagnosis techniques, ECC, pp.2584-2590, 1990.

J. Engelfriet, Iterated pushdown automata and complexity classes, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.365-373, 1983.
DOI : 10.1145/800061.808767

J. Esparza, A. Ku?era, and R. Mayr, Model checking probabilistic pushdown automata, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2006.
DOI : 10.1109/LICS.2004.1319596
URL : http://arxiv.org/abs/cs/0508003

R. J. Evey, The theory and application of pushdown store machines. Mathematical linguistic and automatic translation report NSF-10, 1963.

E. Filiot, O. Gauwin, P. Reynier, and F. Servais, Streamability of Nested Word Transductions, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum für Informatik, pp.312-324, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00566409

L. Frantzen, J. Tretmans, and T. A. Willemse, A Symbolic Framework for Model-Based Testing, FATES 2006 and RV 2006, Revised Selected Papers, pp.40-54, 2006.
DOI : 10.1007/11940197_3

C. Hadjicostis and A. Saboori, Notions of security and opacity in discrete event systems, Decision and Control 46th IEEE Conference on, pp.5056-5061, 2007.

J. Harrison, Formal verification at Intel, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., p.45, 2003.
DOI : 10.1109/LICS.2003.1210044

S. Hassen, Synchronisation de grammaires de graphes, 2008.

K. Havelund and G. Rosu, Monitoring Java Programs with Java PathExplorer, Electronic Notes in Theoretical Computer Science, vol.55, issue.2, pp.200-217, 2001.
DOI : 10.1016/S1571-0661(04)00253-1

K. Havelund and G. Rosu, Efficient monitoring of safety properties, International Journal on Software Tools for Technology Transfer, vol.1, issue.2, pp.158-173, 2004.
DOI : 10.1007/s10009-003-0117-6

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Second Edition, 2001.

C. Jard and T. Jéron, TGV: theory, principles and algorithms, International Journal on Software Tools for Technology Transfer, vol.17, issue.4, pp.297-315, 2005.
DOI : 10.1007/s10009-004-0153-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.4262

B. Jeannet, T. Jéron, and V. Rusu, Model-Based Test Selection for Infinite-State Reactive Systems, 5th International Symposium on Formal Methods for Components and Objects (FMCO'06), Revised Lectures, pp.47-69, 2006.
DOI : 10.1007/978-3-540-74792-5_3
URL : https://hal.archives-ouvertes.fr/inria-00564604

T. Jéron, H. Marchand, S. Pinchinat, and M. Cordier, Supervision Patterns in Discrete Event Systems Diagnosis, 2006 8th International Workshop on Discrete Event Systems, pp.262-268, 2006.
DOI : 10.1109/WODES.2006.1678440

T. Jéron, Contribution à la génération automatique de tests pour les systèmes réactifs, 2004.

T. Knapik, D. Niwinski, and P. Urzyczyn, Higher-Order Pushdown Trees Are Easy, Foundations of Software Science and Computation Structures, pp.205-222, 2002.
DOI : 10.1007/3-540-45931-6_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.5773

K. Kobayashi and K. Hiraishi, Verification of Opacity and Diagnosability for Pushdown Systems, Journal of Applied Mathematics, vol.36, issue.2, 2013.
DOI : 10.1007/978-3-540-24597-1_10

M. Krichen and S. Tripakis, Conformance testing for real-time systems, Formal Methods in System Design, vol.10, issue.1???2, pp.238-304, 2009.
DOI : 10.1007/s10703-009-0065-1

S. Kuroda, Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964.
DOI : 10.1016/S0019-9958(64)90120-2

K. G. Larsen, M. Mikucionis, and B. Nielsen, Online Testing of Real-time Systems Using Uppaal, Formal Approaches to Software Testing, pp.79-94, 2005.
DOI : 10.1007/s100090050044

A. Maslov, Multilevel stack automata. Problems of Information Transmission, pp.38-43, 1976.

L. Mazaré, Using unification for opacity properties, Proceedings of the 4th Workshop on Issues in the Theory of Security, WITS 04, pp.165-176, 2004.

R. Milner, Communication and concurency, 1989.

C. Morvan and S. Pinchinat, Diagnosability of Pushdown Systems, HVC2009, Haifa Verification Conference, pp.21-33, 2009.
DOI : 10.1109/TAC.2002.802763
URL : https://hal.archives-ouvertes.fr/inria-00525397

D. Muller and P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8

D. Park, Concurrency and automata on infinite sequences, 5th GIConference, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

D. Peled, Software Reliability Methods, 2001.
DOI : 10.1007/978-1-4757-3540-6

C. A. Petri, Kommunikation mit Automaten, 1962.

A. Saboori and C. Hadjicostis, Verification of Infinite-Step Opacity and Complexity Considerations, IEEE Transactions on Automatic Control, vol.57, issue.5, pp.1265-1269, 2012.
DOI : 10.1109/TAC.2011.2173774

M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis, Diagnosability of discrete-event systems, IEEE Transactions on Automatic Control, vol.40, issue.9, pp.1555-1575, 1995.
DOI : 10.1109/9.412626

M. Sampath, R. Sengupta, S. Lafortune, K. Sinaamohideen, and D. Teneketzis, Failure diagnosis using discrete-event models, IEEE Transactions on Control Systems Technology, vol.4, issue.2, pp.105-124, 1996.
DOI : 10.1109/87.486338

D. Thorsley and D. Teneketzis, Diagnosability of stochastic discrete-event systems, IEEE Transactions on Automatic Control, vol.50, issue.4, pp.476-492, 2005.
DOI : 10.1109/TAC.2005.844722

]. J. Tretmans, Test generation with inputs, outputs and repetitive quiescence. Software - Concepts and Tools, pp.103-120, 1996.
DOI : 10.1007/3-540-61042-1_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.9528

J. Tretmans and H. Brinksma, Torx : Automated model-based testing, First European Conference on Model-Driven Software Engineering, pp.31-43, 2003.

S. Tripakis, Fault Diagnosis for Timed Automata, LNCS, vol.2469, pp.205-224, 2002.
DOI : 10.1007/3-540-45739-9_14

T. Ushio, I. Onishi, and K. Okuda, Fault detection based on Petri net models with faulty behaviors, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), pp.113-118, 1998.
DOI : 10.1109/ICSMC.1998.725394

I. Walukiewicz, Model Checking CTL Properties of Pushdown Systems, Lecture Notes in Computer Science, pp.127-138, 1974.
DOI : 10.1007/3-540-44450-5_10

T. Yoo and S. Lafortune, Polynomial-time verification of diagnosability of partiallyobserved discrete event systems, IEEE Trans. on Automatic Control, vol.47, issue.3, pp.1491-1495, 2002.