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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757

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

P. Baldan, T. Chatain, S. Haar, and B. König, Unfolding-Based Diagnosis of Systems with an Evolving Topology, Lecture Notes in Computer Science, vol.5201, pp.203-217, 2008.
DOI : 10.1007/978-3-540-85361-9_19
URL : https://hal.archives-ouvertes.fr/inria-00638204

E. Bouajjani and M. , 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

T. Cachat and I. Walukiewicz, The complexity of games on higher order pushdown automata, CoRR, abs/0705, p.262, 2007.

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

A. Grastien, J. Anbulagan, E. Rintanen, and . Kelareva, Diagnosis of discrete-event systems using satisfiability algorithms, AAAI, pp.305-310, 2007.

S. Illias, Higher order visibly pushdown languages, Master's thesis, Indian Institute of Technology, 2005.

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, 2006.
DOI : 10.1109/WODES.2006.1678440

S. Jiang, Z. Huang, V. Chandra, and R. Kumar, A polynomial time algorithm for diagnosability of discrete event systems, IEEE Transactions on Automatic Control, pp.46-1318, 2001.

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

C. L. Ong, Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes, Lecture Notes in Computer Science, vol.4708, pp.15-21, 2007.
DOI : 10.1007/978-3-540-74456-6_4

J. Rintanen, Diagnosers and diagnosability of succinct transition systems, pp.538-544, 2007.

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

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

J. N. Tsitsiklis, On the control of discrete-event dynamical systems, Mathematics of Control, Signals, and Systems, vol.25, issue.2, pp.95-107, 1989.
DOI : 10.1007/BF02551817

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, vol.1974, pp.127-138, 2000.
DOI : 10.1007/3-540-44450-5_10

T. Yoo and S. Lafortune, Polynomial-time verification of diagnosability of partially-observed discreteevent systems, IEEE Transactions on Automatic Control, pp.47-1491, 2002.