N. Dean and . Arden, Delayed-logic and finite-state machines, Proceedings of the 2Nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), FOCS '61, pp.133-151, 1961.

G. R. Argiroffo, S. M. Bianchi, and A. Wagler, Polyhedra associated with identifying codes, Electronic Notes in Discrete Mathematics, vol.44, pp.175-180, 2013.
DOI : 10.1016/j.endm.2013.10.027

M. J. Koen, . De-bontridder, V. Bjarni, M. M. Halldórsson, . Halldórsson et al., Approximation algorithms for the test cover problem, Math. Program, vol.98, pp.1-3477, 2003.

E. Charbit, I. Charon, G. D. Cohen, O. Hudry, and A. Lobstein, Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity, Advances in Mathematics of Communications, vol.2, issue.4, pp.403-420, 2008.
DOI : 10.3934/amc.2008.2.403

I. Charon, G. D. Cohen, O. Hudry, and A. Lobstein, Discriminating codes in (bipartite) planar graphs, European Journal of Combinatorics, vol.29, issue.5, pp.1353-1364, 2008.
DOI : 10.1016/j.ejc.2007.05.006
URL : http://doi.org/10.1016/j.ejc.2007.05.006

I. Charon, O. Hudry, and A. Lobstein, Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard, Theoretical Computer Science, vol.290, issue.3, pp.2109-2120, 2003.
DOI : 10.1016/S0304-3975(02)00536-4

Z. Dvorak, Two-factors in orientated graphs with forbidden transitions, Discrete Mathematics, vol.309, issue.1, pp.104-112, 2009.
DOI : 10.1016/j.disc.2007.12.050

H. Fleischner and B. Jackson, Compatible path-cycle-decompositions of plane graphs, Journal of Combinatorial Theory, Series B, vol.42, issue.1, pp.94-121, 1987.
DOI : 10.1016/0095-8956(87)90066-9

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

G. Gutin and E. J. Kim, Properly Coloured Cycles and Paths: Results and Open Problems, Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp.200-208, 2009.
DOI : 10.1006/jctb.1997.1728
URL : http://arxiv.org/abs/0805.3901

T. W. Haynes, D. J. Knisley, E. Seier, and Y. Zou, A quantitative analysis of secondary rna structure using domination based parameters on trees, BMC Bioinformatics, vol.7, issue.1, p.108, 2006.
DOI : 10.1186/1471-2105-7-108

S. Iiro, T. Honkala, S. M. Laihonen, and . Ranto, On strongly identifying codes, Discrete Mathematics, vol.254, issue.1-3, pp.191-205, 2002.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation -international edition, 2003.
DOI : 10.1145/568438.568455

F. Z. Mamadou-moustapha-kanté, B. Moataz, N. Momège, and . Nisse, Finding paths in grids with forbidden transitions, Graph-Theoretic Concepts in Computer Science -41st International Workshop, WG 2015, pp.154-168, 2015.

G. Mark, K. Karpovsky, L. B. Chakrabarty, and . Levitin, On a new class of codes for identifying vertices in graphs, IEEE Transactions on Information Theory, vol.44, issue.2, pp.599-611, 1998.

O. Jeong-han-kim, J. H. Pikhurko, O. Spencer, and . Verbitsky, How complex are random graphs in first order logic? Random Struct, Algorithms, vol.26, issue.12, pp.119-145, 2005.

S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, 1956.
DOI : 10.1515/9781400882618-002

M. Laifenfeld, A. Trachtenberg, R. Cohen, and D. Starobinski, Joint monitoring and routing in wireless sensor networks using robust identifying codes, pp.415-432, 2009.
DOI : 10.1109/broadnets.2007.4550425
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.5658

S. Maheshwari, Traversal marker placement problem are np-complete In Research report no CU-CS-092-76, 1976.

G. Metze, D. R. Schertz, K. To, G. Whitney, C. R. Kime et al., Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences", IEEE Transactions on Computers, vol.24, issue.1, p.108, 1975.
DOI : 10.1109/T-C.1975.224091

P. Meurdesoif, P. Pesneau, and F. Vanderbeck, Meter installation for monitoring network traffic, International Network Optimization Conference (INOC), Spa, Belgium, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00281945

B. Moret and H. Shapiro, On Minimizing a Set of Tests, SIAM Journal on Scientific and Statistical Computing, vol.6, issue.4, pp.983-1003, 1985.
DOI : 10.1137/0906067

M. Patrenahalli, K. Narendra, and . Fukunaga, A branch and bound algorithm for feature subset selection, IEEE Trans. Computers, vol.26, issue.9, pp.917-922, 1977.

S. J. Seo and P. J. Slater, Open neighborhood locating???dominating in trees, Discrete Applied Mathematics, vol.159, issue.6, pp.484-489, 2011.
DOI : 10.1016/j.dam.2010.12.010
URL : http://doi.org/10.1016/j.dam.2010.12.010

S. J. Seo and P. J. Slater, Open neighborhood locating-domination for infinite cylinders, Proceedings of the 49th Annual Southeast Regional Conference on, ACM-SE '11, pp.334-335, 2011.
DOI : 10.1145/2016039.2016134

S. Szeider, Finding paths in graphs avoiding forbidden transitions, Discrete Applied Mathematics, vol.126, issue.2-3, pp.261-273, 2003.
DOI : 10.1016/S0166-218X(02)00251-2
URL : http://doi.org/10.1016/s0166-218x(02)00251-2

R. Ungrangsi, A. Trachtenberg, and D. Starobinski, An Implementation of Indoor Location Detection Systems Based on Identifying Codes, In INTELLCOMM, pp.175-189, 2004.
DOI : 10.1007/978-3-540-30179-0_16

B. Holmes, W. R. Willcox, and S. P. Lapage, A review of numerical methods in bacterial identification, Antonie van Leeuwenhoek, vol.46, issue.3, pp.233-299, 1980.

W. R. Willcox and S. P. Lapage, Automatic construction of diagnostic tables, The Computer Journal, vol.15, issue.3, pp.263-267, 1972.
DOI : 10.1093/comjnl/15.3.263