H. Carstensen, Infinite behaviour of deterministic petri nets, Proceedings of Mathematical Foundations of Computer Science, pp.210-219, 1988.
DOI : 10.1007/BFb0017144

O. Carton and D. Perrin, Chains and Superchains for ??-Rational Sets, Automata and Semigroups, International Journal of Algebra and Computation, vol.07, issue.06, pp.673-695, 1997.
DOI : 10.1142/S0218196797000290

O. Carton and D. Perrin, The Wadge-Wagner hierarchy of ??-rational sets, International Journal of Algebra and Computation, vol.9, issue.5, pp.597-620, 1999.
DOI : 10.1007/3-540-63165-8_162
URL : https://hal.archives-ouvertes.fr/hal-00693993

R. Cohen and A. Gold, ??-Computations on Turing machines, Theoretical Computer Science, vol.6, issue.1, pp.1-23, 1978.
DOI : 10.1016/0304-3975(78)90002-6

J. Duparc, La forme Normale des Boréliens de rang finis, 1995.

J. Duparc, Abstract, The Journal of Symbolic Logic, vol.1333, issue.01, pp.56-86, 2001.
DOI : 10.2307/1971035

J. Duparc, A hierarchy of deterministic context-free ??-languages, Theoretical Computer Science, vol.290, issue.3, pp.1253-1300, 2003.
DOI : 10.1016/S0304-3975(02)00567-4

J. Duparc, O. Finkel, and J. Ressayre, Computer science and the fine structure of Borel sets, Theoretical Computer Science, vol.257, issue.1-2, pp.85-105, 2001.
DOI : 10.1016/S0304-3975(00)00111-0
URL : https://hal.archives-ouvertes.fr/hal-00103673

J. Duparc, O. Finkel, and J. Ressayre, The Wadge hierarchy of Petri nets ?-languages, Proceedings of the International Symposium on Logical Foundations of Computer Science, pp.179-193, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00743510

J. Engelfriet and H. J. Hoogeboom, X-automata on ??-words, Theoretical Computer Science, vol.110, issue.1, pp.1-51, 1993.
DOI : 10.1016/0304-3975(93)90349-X

J. Esparza, Decidability and complexity of Petri net problems, an introduction. Lectures on Petri Nets I: Basic Models, pp.374-428, 1998.

H. Fernau and R. Stiebe, Blind counter automata on ?-words. Fund, Inform, vol.83, issue.12, pp.51-64, 2008.

S. Greibach, Remarks on blind and partially blind one-way multicounter machines, Theoretical Computer Science, vol.7, issue.3, pp.311-324, 1978.
DOI : 10.1016/0304-3975(78)90020-8
URL : http://doi.org/10.1016/0304-3975(78)90020-8

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2001.

A. S. Kechris, Classical descriptive set theory, 1995.
DOI : 10.1007/978-1-4612-4190-4

L. Landweber, Decision problems for??-automata, Mathematical Systems Theory, vol.9, issue.4, pp.376-384, 1969.
DOI : 10.1007/BF01691063

H. Lescow and W. Thomas, Logical specifications of infinite computations, Decade of Concurrency, pp.583-621, 1994.

D. A. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035

Y. N. Moschovakis, Descriptive set theory, 2009.
DOI : 10.1090/surv/155

R. M. Naughton, Testing and generating infinite sequences by a finite automaton, Information and Control, vol.9, issue.5, pp.521-530, 1966.
DOI : 10.1016/S0019-9958(66)80013-X

D. Perrin and J. Pin, Infinite words, automata, semigroups, logic and games, Pure and Applied Mathematics, vol.141, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

G. Rozenberg, Lectures on concurrency and Petri nets: advances in Petri nets, 2004.

V. Selivanov, Fine hierarchy of regular ??-languages, Proceedings of the International Joint Conference on the Theory and Practice of Software Development TAPSOFT-95, pp.277-287, 1995.
DOI : 10.1007/3-540-59293-8_201

V. Selivanov, Fine hierarchy of regular ??-languages, Theoretical Computer Science, vol.191, issue.1-2, pp.37-59, 1998.
DOI : 10.1016/S0304-3975(97)00301-0

V. Selivanov, Wadge Degrees of ??-Languages of Deterministic Turing Machines, Proceedings of the International Conference STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, pp.97-108, 2003.
DOI : 10.1007/3-540-36494-3_10

V. Selivanov, Wadge degrees of ?-languages of deterministic Turing machines, Theoretical Informatics and Applications, pp.67-83, 2003.

V. Selivanov, Fine hierarchies and m-reducibilities in theoretical computer science, Theoretical Computer Science, vol.405, issue.1-2, pp.116-163, 2008.
DOI : 10.1016/j.tcs.2008.06.031

V. Selivanov, FINE HIERARCHY OF REGULAR APERIODIC ??-LANGUAGES, International Journal of Foundations of Computer Science, vol.19, issue.03, pp.649-675, 2008.
DOI : 10.1142/S0129054108005875

V. Selivanov, Wadge Reducibility and Infinite Computations, Mathematics in Computer Science, vol.2, issue.1, pp.5-36, 2008.
DOI : 10.1007/s11786-008-0042-x

W. Sierpinski, Cardinal and ordinal numbers, PWN (Warszawa), 1965.

P. Simonnet, Automates et théorie descriptive, 1992.

L. Staiger, Hierarchies of recursive ?-languages, Elektronische Informationsverarbeitung und Kybernetik, vol.22, issue.5-6, pp.219-241, 1986.

L. Staiger, Research in the theory of ?-languages, Mathematical aspects of informatics (Mägdesprung, pp.415-439, 1986.

L. Staiger, ??-Languages, Handbook of formal languages, pp.339-387, 1997.
DOI : 10.1007/978-3-642-59126-6_6

L. Staiger and K. Wagner, Rekursive Folgenmengen I, Zeitschrift f??r Mathematische Logik und Grundlagen der Mathematik, vol.22, issue.31-36, pp.523-538, 1978.
DOI : 10.1002/malq.19780243107

W. Thomas, Automata on infinite objects Handbook of Theoretical Computer Science, volume B, Formal models and semantics, pp.135-191, 1990.

R. Valk, Infinite behaviour of Petri nets. Theoretical computer science, pp.311-341, 1983.

W. Wadge, Reducibility and determinateness in the Baire space, 1983.

K. Wagner, On ??-regular sets, Information and Control, vol.43, issue.2, pp.123-177, 1979.
DOI : 10.1016/S0019-9958(79)90653-3

T. Wilke and H. Yoo, Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time, TAPSOFT 95, pp.288-302, 1995.
DOI : 10.1007/3-540-59293-8_202