Aller à : contenu haut bas recherche
 
 
EN     FR
Vous êtes ici:   UNIL > HEC > RECHERCHE
Contact
 
 

Jacques Duparc

Coordonnées

Professeur ordinaire
Département des systèmes d'information


Contact
Jacques.Duparc@unil.ch
Tél 021.692.35.88

Adresse postale
Université de Lausanne
Quartier UNIL-Dorigny
Bâtiment Internef
1015 Lausanne

Enseignements

bachelor Introduction à la logique
Formation concernée
Baccalauréat universitaire ès Sciences en management

Recherches

Axes de recherche

AutoMathA
De la théorie des automates des mathématiques aux applications Pour plus d'information : www.esf.org/automatha

Complexité Topologique, Jeux, Logique et Automates
L'un des projets consiste à déméler la fine structure topologique des omega-langages d'arbres réguliers. En d'autres termes, il s'agit de découvrir la hierarchie de Wadge des automates d'arbres infinis non déterministes L'autre cherche à caractériser les fonctions boréliennes comme des stratégies dans des jeux correctement définis. Le cas des fonctions de classe de Baire un entier fini fournissant une première étape déjà difficile

GAMES
Mise en oeuvre des méthodes formelles qui garantissent la fiabilité, la rectitude et l'efficacité des systèmes informatiques, en dévellopant des méthodes de spécification et de validation qui sont basées sur les jeux et les automates

Topologies profinies en théorie des automates
Etude des relations de réduction entre langages réguliers, basées sur fonctions uniformément continues - pour diverses topologies profinies.

Compétences

Logique mathématique
Fondement des mathématiques (théorie des ensembles) et fondement de l'informatique (informatique théorique).


Evénements

Conferences

CSL'07
Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL)
The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science
CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne
The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07

A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007
Suisse

GAMES'07
The Annual GAMES-Meeting 2007 will be held in Lausanne, Switzerland, on September 10-13, 2007. It will be co-located with CSL 2007, with a joint programme on September 11. As in previous years, GAMES 2007 will be an informal workshop, without proceedings, with a programme consisting of five invited tutorials (90 min), contributed talks (30 min) and short presentations (15 min). Contributed talks and short presentations will be selected by the programme committee on the basis of submitted abstracts



Suisse

Assistants

Kevin Fournier
kevin.fournier@unil.ch
Tél: (021 692) 3596
Bureau: 127.1

  Yann Pequignot
yann.pequignot@unil.ch

Bureau: 127.1

page personnelle
 

Publications

40 publications classées par: type de publication  -  année

: Revue avec comité de lecture

Articles

Cabessa J. & Duparc J. (2009). A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy: Part II. RAIRO-Theor. Inf. Appl., 43(3), 463-515. [doi] [abstract] Revue avec comité de lecture

Cabessa J. & Duparc J. (2008). The Algebraic Counterpart of the Wagner Hierarchy. Lecture Notes in Computer Science, 5028, 100-109. [doi] [abstract] Revue avec comité de lecture

Duparc J. & Finkel O. (2007). Wadge games and sets of reals recognized by simple machines: An omega power of a finite context-free language which is Borel above Delta^ø_omega. Studies in Logic, 11, 109-122. Revue avec comité de lecture

Duparc J. & Riss M. (2006). The Missing Link for omega-Rational Sets, Automata, and Semigroups. International Journal of Algebra and Computation, 16(1), 161-186. [abstract] Revue avec comité de lecture

Duparc J. (2003). A Hierarchy of Deterministic Context-Free omega-languages. Theoretical Computer Science, 290(3), 1253-1300. [abstract] Revue avec comité de lecture

Duparc J. (2003). The Steel Hierarchy of Ordinal Valued Borel Mappings. Journal of Symbolic Logic, 68(1), 187-234. [url] [abstract] Revue avec comité de lecture

Duparc J. (2001). Wadge Hierarchy and Veblen Hierarchy. Part I: Borel Sets of Finite Rank. Journal of Symbolic Logic, 66(1), 56-86. Revue avec comité de lecture

Duparc J., Finkel O. & Ressayre J-P. (2001). Computer Science and the Fine Structure of Borel Sets. Theoretical Computer Science, 257(1-2), 85-105. [abstract] Revue avec comité de lecture

Duparc J. (1999). The Normal Form of Borel Sets. Part II: Borel Sets of Infinite Rank. C. R. Acad. Sci. Paris, t. 328(Série I), 735-740. [abstract] Revue avec comité de lecture

Duparc J. (1995). The Normal Form of Borel Sets. Part I: Borel Sets of Finite Rank. C. R. Acad. Sci. Paris, t. 320(Série I), p. 651-656. [abstract] Revue avec comité de lecture

Parties de livre

Duparc J., Finkel O. & Ressayre J-P. (2014). The Wadge Hierarchy of Petri Nets omega-Languages. In Brattka V., Diener H. & Spreen D. (Eds.), Ontos Mathematical Logic 4, Logic, Computation, Hierarchies (pp. 109-138). De Gruyter.

Arnold A., Duparc J., Murlak F. & Niwiński D. (2007). On the topological complexity of tree languages. In Flum J., Grädel E. & Wilke T. (Eds.), Texts in Logic and Games, Logic and Automata: History and Perspectives (Vol. 2, pp. 9-28). Amsterdam University Press. [url] Revue avec comité de lecture

Actes de conférence (partie)

Duparc J., Finkel O. & Ressayre J.-P. (2013). The Wadge Hierarchy of Petri Nets \emph\(\omega\)-Languages. Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings (pp. 179-193). [doi] [url]

Duparc J., Facchini A. & Murlak F. (2011). Definable Operations On Weakly Recognizable Sets of Trees. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India (pp. 363-374). [doi] [url]

Cabessa J., Duparc J., Facchini A. & Murlak F. (2009, Déc). The Wadge Hierarchy of Max-Regular Languages. In Kannan Ravi & Narayan Kumar K. (Eds.), Leibniz International Proceedings in Informatics (LIPIcs), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), 4 (pp. 121-132). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany. [doi] [pdf] [url] Revue avec comité de lecture

Duparc J., Facchini A. & Murlak F. (2009). Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. In Grädel E. & Kahle R. (Eds.), Lecture Notes in Computer Science, Computer Science Logic: 23rd International Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009, Proceedings, 5771 (pp. 225-239). Springer. [pdf] [url] Revue avec comité de lecture

Facchini A. & Duparc J. (2009). A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata. In Archibald Margaret, Brattka Vasco, Goranko Valentin & Löwe Benedikt (Eds.), Lecture Notes in Artificial Intelligence, Selected Papers of the International Conference Infinity in Logic and Computation, Cape Town, South Africa, November 2007, 5489. Springer. [pdf] Revue avec comité de lecture

Duparc J. & Facchini A. (2008). Describing the Wadge Hierarchy for the Alternation Free Fragment of μ -Calculus (I)The Levels Below ω 1. In Arnold Beckmann, Costas Dimitracopoulos, & Benedikt Löwe (Eds.), Lecture Notes in Computer Science, Logic and Theory of Algorithms, Fourth Conference on Computability in Europe, CiE 2008, Athens, Greece, June 2008, Proceedings, 5028. Springer. Revue avec comité de lecture

Cabessa J. & Duparc J. (2007). An infinite game on omega-semigroups. Studies in Logic, Infinite Games, Papers of the conference Foundations of the Formal Sciences V, held in Bonn, November 26-29, 2004, 11 (pp. 63-78). Bold S.Löwe B.Räsch T.van Benthem J., College Publications, London. Revue avec comité de lecture

Duparc J. & Finkel O. (2007). An ω-power of a finite context-free language which is Borel above ∆0ω. Studies in Logic, Infinite Games, Papers of the conference Foundations of the Formal Sciences V, held in Bonn, November 26-29, 2004, 11 (pp. 109-122). Bold S. Löwe B. Räsch T. van Benthem J., College Publications, London. Revue avec comité de lecture

Duparc J. & Henzinger T.A. (2007, Sep). Computer Science Logic. 21st International Workshop, CSL 2007 16th Annual Conference of the EACSL Lausanne, Switzerland, 4646. Springer. Revue avec comité de lecture

Duparc J. & Murlak F. (2007). On the Topological Complexity of Weakly Recognizable Tree Languages. Lecture Notes on Computer Acience, Proceedings of the 16th International Symposium, Funda,mentals of Computation Theory, 4639 (pp. 261-273). Revue avec comité de lecture

Duparc J., Bradfield J. & Quickert S. (2005). Transfinite extension ot the mu-calculus. In Ong L. (Ed.), Lecture Notes in Computer Science, Proceedings 14th annual European conference Computer Science Logic, 3634. Springer Berlin / Heidelberg. Revue avec comité de lecture

Duparc J. (2003). Posivitive Games and persistent Strategies. Lecture Notes in Computer Science, 12th Annual Conference of the European Association for Computer Science Logic, 2803 (pp. 182-196). Springer, Vienna, Austria. Revue avec comité de lecture

Cachat T., Duparc J. & Thomas W. (2002). Solving Pushdown Games with a Sigma_3 Winning Condition. In Bradfield J. (Ed.), Lecture Notes in Computer Science, Proceedings of the 11th Annual Conference of the European Association for Computer Science Logic, CSL 2002, 2471 (pp. 322-336). Revue avec comité de lecture

Duparc J., Finkel O. & Ressayre J-P. (2000). Infinite Games, Finite Machines. Proceedings of the Joint Conference of the 5th Barcelona Logic Meeting and the 6th Kurt Gödel colloquium, Collegium Logicum, Annals of the Kurt-Gödel-Society Vol 4, 2000. Revue avec comité de lecture

Duparc J. (1994). The Normal Form of Borel Sets of Finite Rank. Contibuted Papers of the Logic Colloquium'94. Revue avec comité de lecture

Rapports

Cahiers de recherche

Duparc J. & Facchini A. (2009). The Topological Complexity of Models of the Modal μ-Calculus: On The Alternation Free Fragment and Beyond. Laboratoire Bordelais de Recherche en Informatique et Université de Lausanne. [url]

Thèses

Carroy R., Duparc, J. & Finkel, O. (Dir.) (2013). Fonctions de première classe de Baire. Université de Lausanne, Faculté des hautes études commerciales.

Bach C. W., Jacques D. & Hans P. (Dir.) (2010). Interactive Epistemology and Reasoning: On the Foundations of Game Theory. Université de Lausanne, Faculté des hautes études commerciales. [abstract]

Facchini A., Duparc J. (Dir.) (2010). A study on the expressive power of some fragments of the modal µ-Calculus. Université de Lausanne, Faculté des hautes études commerciales. [abstract]

Cabessa J., Duparc J. (Dir.) (2007). A game theoretical approach to the algebraic counterpart of the Wagner hierarchy. Université de Lausanne, Faculté des hautes études commerciales. [pdf] [abstract]

Duparc J. (1995). La Forme Normale des Boréliens de Rang fini. University Paris 7.

Non publié

Duparc J. (2008). A Normal Form of Borel Sets of Finite Rank. submitted to Notre-Dame Journal of Formal Logic radically different proofs and tools than the ones in the article submitted to JSL. These proofs are close to the ones in my Ph.D. Thesis, but extremely reduced. [abstract]

Duparc J. Wadge Hierarchy and Veblen Hierarchy. Part II: Borel Sets of Infinite Rank. submitted to the Journal of Symbolic Logic. [abstract]

Duparc J. A Normal Form for Borel Sets. extended abstract, not submitted. [abstract]

Duparc J. A Coarsification of the Wagner Hierarchy. submitted to Theoretical Computer Science. [abstract]

Duparc J. Wadge Degrees of Louveau's (Wadge) Classes. related to the extended abstract "A Normal Form for Borel Sets" (temporary version). [abstract]

Duparc J. Anti-Chains of Mappings from omega^omega on some BQO. temporary version, to be submitted. [abstract]

Autres

Duparc J. & Cabessa J. (2004). Games on Semigroups.

Curriculum

Formations

Doctorat de mathématiques
Université Paris VII-Denis Diderot, (1995)

 
 
Recherche


         
Inscriptions aux examens
Internef - CH-1015 Lausanne - Suisse  -   Tél. +41 21 692 33 00  -   Fax +41 21 692 33 05
Swiss University