UMONS
Faculté des sciencesDépartement de mathématiqueService de Mathématiques EffectivesRecherche
Thèmes de recherche
Nos principales activités de recherche sont:
- Vérification de systèmes temporisés et hybrides
- Contrôle de systèmes temporisés et hybrides
- Théorie des jeux et ses applications à la vérification CASSTING project
- Conception d'algorithmes efficaces pour la vérification (basés sur les antichaînes)
- Application de la théorie des jeux à la microfinance MIGA project
Publications
2015
Publications référencées
- , Simple strategies for Banach-Mazur games and sets of probability 1, Information & Computation, (2015), Academic Press.
publications (non référencées)
- , Quantitative Games under Failures, Leibniz International Proceedings in Informatics, (2015).
- , Simple Priced Timed Games Are Not That Simple, Leibniz International Proceedings in Informatics, (2015).
- , Difficultés d'étudiants universitaires à reconnaître les objets "droites" et "plans" dans l'espace, 2015.
- , Verification and synthesis of MITL through alternating timed automata, 2015.
- , Difficultés d'élèves à interpréter des constructions dans l'espace. Une étude de cas., Petit X, 98 (2015), pp. 53–76, Institut de Recherche sur l'Enseignement des Mathématiques.
- , To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games., Leibniz International Proceedings in Informatics, (2015).
- , Composition of stochastic timed automata, Frontiers of Formal Methods, Aachen, Allemagne, 2015.
Vulgarisation
- , Quand les jeux mènent aux prix Nobel, 2015.
- , Thomas Brihaye, professeur d’analyse à Mons et à... Port-au-Prince !, 2015, Daily Science, .
- , Les ordinateurs quantiques, quelles conséquences pour la complexité algorithmique ?, 2015.
Présentations & posters sans abstract
- , A brief introduction to evolutionnary game theory, Sixth Cassting meeting, Cachan, France, 2015.
- , Compositional Design of Stochastic Timed Automata, Annual seminar of the LSV, Dourdan, France, 2015.
- , Difficultés d'étudiants universitaires dans la conceptualisation des équations de droites et de plans dans l'espace., Séminaire WEJCH 2015, Mons, Belgique, 2015.
- , About Banach-Mazur games, AutoMathA 2015 : Jewels of Automata : from Mathematics to Applications, Leipzig, Allemagne, 2015.
- , Compositional Design of Stochastic Timed Automata, Méthodes formelles et Vérification, Bruxelles (ULB), Belgique, 2015.
- , Composition of stochastic timed automata, ERC Workshop in Verification, Vienne, Autriche, 2015.
2014
Publications référencées
- , Stochastic Timed Automata, Logical Methods in Computer Science, (2014), Technische Universität Braunschweig. Institut für Theoretische Informatik.
- , Existence of Secure Equilibrium in Multi-Player Games with Perfect Information, Lecture Notes in Computer Science, 8635 (2014), pp. 213–225, Springer.
- , On MITL and Alternating Timed Automata over Infinite Words, Lecture Notes in Computer Science, (2014), Springer.
- , Randomization in Automata on Infinite Trees, ACM Transactions on Computational Logic, 15 (2014), pp. 1–33. DOI: 10.1145/2629336.
- , Deciding the value 1 problem in 1-clock Decision Stochastic Timed Automata, Lecture Notes in Computer Science, (2014), Springer.
- , Adding negative prices to priced timed games, Lecture Notes in Computer Science, (2014), Springer.
publications (non référencées)
- , On MITL and alternating timed automata over infinite words, 2014.
- , On alternating timed automata for MITL, Journées montoises d'informatique théorique, Nancy, France, 2014.
- , Equilibria in Multiplayer Cost Games, Dagstuhl Seminar: ”Quantitative Models: Expressiveness, Analysis, and New Applications”, Dagstuhl, Germany, 2014.
Vulgarisation
- , Mathématiques, théorie des jeux et prix Nobel, 2014, Exposé, CREM (Nivelles).
- , Mathématiques : quand les jeux mènent aux prix Nobel, 2014, Exposé, Collège Notre-Dame (Tournai).
- , Applications de la théorie des jeux en informatique, 2014, Exposé, Académie royale des sciences, des lettres et des beaux-arts de Belgique.
- , Mathématiques, théorie des jeux et prix Nobel, 2014, Exposé, Université du Luxembourg.
- , Quand les jeux mènent aux prix Nobel, 2014, Exposé, Institut Sainte Marie (La Louvière).
Présentations & posters avec abstract
- , Existence of Secure Equilibrium in Multi-Player Games with Perfect Information, Mathematical Foundations of Computer Science 2014 - 39th International Symposium (MFCS 2014), Budapest, Hungary, 2014.
- , Equilibria in Multiplayer Cost Games, Dagstuhl Seminar: ”Quantitative Models: Expressiveness, Analysis, and New Applications”, Dagstuhl, Germany, 2014.
Présentations & posters sans abstract
- , Difficultés d'étudiants universitaires dans la conceptualisation des équations de plans dans l'espace., Journée d'étude "Espace & Abstraction", Mons, Belgique, 2014.
- , On alternating timed automata for MITL, Journées montoises d'informatique théorique, Nancy, France, 2014.
- , On MITL and alternating timed automata over infinite words, FORMATS - Formal Modelling and Analysis of Timed Systems, Florence, Italy, 2014.
- , Deciding the value 1 problem in 1-clock Decision Stochastic Timed Automata, Troisième réunion Cassting, Bruxelles, Belgique, 2014.
- , Banach-Mazur games and fairly correct systems, Réunion du NCM – Comité National de Mathématique, Mons, Belgique, 2014.
- , Multiplayer cost games with simple Nash equilibria, Réunion annuelle du GT jeux du GDR-IM, Paris, France, 2014.
2013
Publications référencées
- , Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points, Lecture Notes in Computer Science, (2013), Springer.
- , On MITL and alternating timed automata, Lecture Notes in Computer Science, (2013), pp. 47–61, Springer.
- , On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games, Logical Methods in Computer Science, 9 (2013), Technische Universität Braunschweig. Institut für Theoretische Informatik.
- , Multiplayer Cost Games with Simple Nash Equilibria, Lecture Notes in Computer Science, 7734 (2013), pp. 59–73, Springer.
- , On Equilibria in Quantitative Games with Reachability/Safety Objectives, Theory of Computing Systems, 54 (2013), pp. 150–189, Springer Science & Business Media B.V..
- , Visibly Pushdown Automata: Universality and Inclusion via Antichains, Lecture Notes in Computer Science, 7810 (2013), pp. 190–201, Springer.
Actes de congrès avec peer-reviewing
- , Model Checking and Functional Program Transformations, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS, Guwahati, Inde, 2013. DOI: 10.1109/LICS.2011.28.
publications (non référencées)
- , Shape-Preserving Transformations of Higher-Order Recursion Schemes, 2013.
- , Antichains for QBF evaluation and VPA decision problems, 2013.
- , Simple strategies for Banach-Mazur games and fairly correct systems, Electronic Proceedings in Theoretical Computer Science [=EPTCS], 119 (2013), pp. 21–34, Open Publishing Association.
- , On MITL and alternating timed automata, 2013.
- , Equilibria in Multiplayer Cost Games, 2013, UMONS.
Vulgarisation
- , Topology, probability, games and verification, 2013, Notes de la cinquième BSSM, .
- , Mathématiques: quand les jeux mènent aux prix Nobel, 2013.
- , Quand les jeux mènent au prix Nobel, 2013.
Présentations & posters sans abstract
- , Banach-Mazur games, Nord Pas de Calais / Belgium Congress of Mathematics, Valenciennes, France, 2013.
- , Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points, ATVA - International Symposium on Automated Technology for Verification and Analysis, Hanoï, Viêt Nam, 2013.
- , On MITL and alternating timed automata, Second Cassting Meeting, Aalborg, Danemark, 2013.
- , Right-Universality of Visibly Pushdown Automata, Runtime Verification, Rennes, France, 2013.
- , Simple strategies for Banach-Mazur games and fairly correct systems, Highlights of Logic, Games and Automata, Paris, France, 2013.
- , On the decidability of priced timed games, Highlights of Logic, Games and Automata, Paris, France, 2013.
- , Simple strategies for Banach-Mazur games and fairly correct systems, Fourth International Symposium on Games, Automata, Logics and Formal Verification, Borca di Cadore, Italie, 2013.
- , Introduction à la théorie des jeux, Ville numérique et agriculture bio-high-tech, Paris , Cité des Sciences, France, 2013.
- , On MITL and alternating timed automata, Méthodes Formelles et Vérification, Bruxelles, Belgique, 2013.
- , Visibly Pushdown Automata: Universality and Inclusion via Antichains, 7th International Conference on Language and Automata Theory and Applications (LATA 2013), Bilbao, Espagne, 2013.
- , Multiplayer Cost Games with Simple Nash Equilibria, Symposium on Logical Foundations of Computer Science (LFCS 2013), San Diego, USA, 2013.
2012
Publications référencées
- , Almost-Sure Model-Checking of Reactive Timed Automata., Proceedings IEEE Computer Society Bioinformatics Conference, QEST 2012 (2012), pp. 138–147.
- , Subgame Perfection for Equilibria in Quantitative Reachability Games., Lecture Notes in Computer Science, 7213 (2012), pp. 286–300, Springer.
Actes de congrès avec peer-reviewing
- , IO vs OI in Higher-Order Recursion Schemes, 8th Workshop on Fixed Points in Computer Science, FICS 2012, Tallinn, Estonie, 2012. DOI: 10.4204/EPTCS.77.4.
publications (non référencées)
- , Portrait de chercheur -- Thomas Brihaye, 2012.
- , Visibly pushdown automata on trees: universality and u-universality, 2012.
Vulgarisation
- , Trains, sécurité, math et jeux, 2012.
- , Retour vers le futur, à toi de jouer!, 2012.
- , Trains, sécurité, math et jeux, 2012.
Présentations & posters sans abstract
- , Visibly pushdown automata on trees: universality and u-universality, CFV seminar, Bruxelles, Belgique, 2012.
- , Almost-Sure Model-Checking of Reactive Timed Automata., QEST, Londres, Angleterre, 2012.
- , Visibly pushdown automata on trees: universality and u-universality, Mons Days of Theoretical Computer Science, Louvain-La-Neuve, Belgique, 2012.
- , Topologie, probabilité, jeux et vérification de systèmes informatiques, Brussels Summer School of Mathematics, Bruxelles, Belgique, 2012.
- , Almost-Sure Model-Checking of Reactive Timed Automata., ERC-Workshop on Quantitative and Game Models for the Synthesis of Reactive Systems, Bruxelles, Belgique, 2012.
- , Subgame Perfection for Equilibria in Quantitative Reachability Games, 15th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2012), Tallinn, Estonie, 2012.
2011
Publications référencées
- , Antichain-Based QBF Solving, Lecture Notes in Computer Science, 6996 (2011), pp. 183–197, Springer.
- , On Reachability for Hybrid Automata over Bounded Time, Lecture Notes in Computer Science, (2011), Springer.
- , On Reachability for Hybrid Automata over Bounded Time, Lecture Notes in Computer Science, (2011), Springer.
- , Emptiness and Universality Problems in Timed Automata with Positive Frequency, Lecture Notes in Computer Science, (2011), Springer.
Actes de congrès avec peer-reviewing
- , Qualitative Tree Languages, 26th Annual IEEE Symposium on Logic in Computer Science, LICS, Toronto, Canada, 2011. DOI: 10.1109/LICS.2011.28.
publications (non référencées)
- , Nash Equilibrium in Quantitative Games Played on Graphs, LogICCC Final Conference, Berlin, Allemagne, 2011.
- , Non, les ordinateurs ne seront jamais tout-puissants!, Element : le Magazine de l'Université de Mons, 5 (2011), Université de Mons.
Présentations & posters sans abstract
- , Nash Equilibrium in Quantitative Games Played on Graphs, LogICCC Final Conference, Berlin, Allemagne, 2011.
- , On Reachability for Hybrid Automata over Bounded Time, Séminaire 68NQRT, Rennes, France, 2011.
- , Subgame Perfect Equilibria in Quantitative Reachability Games, Fifth GASICS Meeting, Mons, Belgique, 2011.
- , On Reachability for Hybrid Automata over Bounded Time, Séminaire de vérification du LIAFA, Paris, France, 2011.
- , Antichain-based QBF Solving, Déjeuners Informatiques de l’UMONS, UMONS, Belgique, 2011.
- , Antichain-based QBF solving, Matinée des chercheurs, UMONS, Belgique, 2011.
- , Antichain-based QBF solving, CFV seminar, Bruxelles, Belgique, 2011.
- , Antichain based QBF solving, Séminaire du département d'informatique de l'université d'Oxford, Oxford, Angleterre, 2011.
2010
Publications référencées
- , Equilibria in Quantitative Reachability Games, Lecture Notes in Computer Science, 6072 (2010), pp. 72–83, Springer. DOI: 10.1007/978-3-642-13182-0_7.
- , Formal languages properties of o-minimal hybrid systems, RAIRO : Informatique Théorique et Applications = Theoretical Informatics and Applications, 44 (2010), pp. 79–111, EDP Science. DOI: 10.1051/ita/2010006.
- , O-Minimal Hybrid Reachability Games, Logical Methods in Computer Science, (2010), Technische Universität Braunschweig. Institut für Theoretische Informatik.
Présentations & posters sans abstract
- , Equilibria in Quantitative Reachability Games, 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russie, 2010.
2009
Publications référencées
- , Weighted o-minimal hybrid systems, Annals of Pure & Applied Logic, 4514 (2009), pp. 69–83, Elsevier Science. DOI: 10.1007/978-3-540-72734-7_6.
- , When Are Timed Automata Determinizable?, Lecture Notes in Computer Science, 5556 (2009), pp. 43–54, Springer. DOI: 10.1007/978-3-642-02930-1_4.
- , Cell decomposition and dimension function in the theory of closed ordered differential fields, Annals of Pure & Applied Logic, 159 (2009), pp. 111–128, Elsevier Science. DOI: 10.1016/j.apal.2008.09.029.
- , ATL with Strategy Contexts and Bounded Memory, Lecture Notes in Computer Science, 5407 (2009), pp. 92–106, Springer. DOI: 10.1007/978-3-540-92687-0_7.
publications (non référencées)
- , Jeux infinis sur graphe, TFE, 2009.
Vulgarisation
- , Economie, environnement et mathématiques, 2009.
2008
Publications référencées
- , Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics, IEEE proceedings, (2008), pp. 55–64. DOI: 10.1109/QEST.2008.19.
- , Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets, Lecture Notes in Computer Science, 5215 (2008), Springer. DOI: 10.1007/978-3-540-85778-5_6.
- , Good Friends are Hard to Find!, IEEE proceedings, (2008), pp. 32–40. DOI: 10.1109/TIME.2008.10.
- , Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata, IEEE proceedings, (2008), pp. 217–226. DOI: 10.1109/LICS.2008.25.
2007
Publications référencées
- , Probabilistic and Topological Semantics for Timed Automata, Lecture Notes in Computer Science, (2007), Springer.
- , On the optimal reachability problem of weighted timed automata, Formal Methods in System Design, 31 (2007), pp. 135–175, Springer Science & Business Media B.V.. DOI: 10.1007/s10703-007-0035-4.
- , Timed Concurrent Game Structures, Lecture Notes in Computer Science, (2007), Springer.
- , Minimum-Time Reachability in Timed Games, Lecture Notes in Computer Science, (2007), Springer.
- , Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!, Lecture Notes in Computer Science, (2007), Springer.
- , Words and Bisimulations of Dynamical Systems, Discrete Mathematics & Theoretical Computer Science, 9 (2007), Chapman & Hall.
2006
Publications référencées
- , Control in o-minimal Hybrid Systems, IEEE proceedings, (2006), pp. 367–378. DOI: 10.1109/LICS.2006.22.
- , Improved undecidability results on weighted timed automata, Information Processing Letters, 98 (2006), Elsevier Science. DOI: 10.1016/j.ipl.2006.01.012.
- , On model-checking timed automata with stopwatch observers, Information & Computation, 204 (2006), Academic Press. DOI: 10.1016/j.ic.2005.12.001.
- , A note on the undecidability of the reachability problem for o-minimal dynamical systems, Mathematical Logic Quarterly, 52 (2006), John Wiley & Sons, Inc. - Engineering. DOI: 10.1002/malq.200510024.
- , Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478], Journal of Complexity, 22 (2006), pp. 431–434, Academic Press.
2005
Publications référencées
- , On optimal timed strategies, Lecture Notes in Computer Science, 3829 (2005), Springer. DOI: 10.1007/11603009_5.
- , On the expressiveness and decidability of o-minimal hybrid systems, Journal of Complexity, 21 (2005), Academic Press. DOI: 10.1016/j.jco.2004.09.003.
2004
Publications référencées
- , Model-Checking for Weighted Timed Automata, Lecture Notes in Computer Science, (2004), Springer.
- , On O-Minimal Hybrid Systems, Lecture Notes in Computer Science, 2993 (2004), Springer.
