2025
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Vandenhove, P. (01 March 2025). "Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives" [Paper presentation]. AAAI Conference on Artificial Intelligence, Philadelphia, United States - Pennsylvania.
vandenhove_aaai25.pdf 
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Belly, M., Fijalkow, N., Gimbert, H., Horn, F., Pérez, G. A., & Vandenhove, P. (2025). Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. "Proceedings of the AAAI Conference on Artificial Intelligence".
2412.12063v1.pdf
Colloques et congrès scientifiques/Communication poster
- Vandenhove, P. (01 March 2025). "Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives" [Poster presentation]. AAAI Conference on Artificial Intelligence, Philadelphia, United States - Pennsylvania.
vandenhove_poster_aaai25.pdf
Allocutions et communications diverses/Autre
- Grandmont, C., & Vandenhove, P. (2025). "Erreur détectée ! Comment les ordinateurs réparent toutes nos erreurs (ou presque !)".
Erreur_détectée__JMS_2025_ (3).pdf
2024
Périodiques scientifiques/Article
- Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. "International Conference on Concurrency Theory (CONCUR), 311", 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14
_LIPIcs.CONCUR.2024.14.pdf arXiv long version.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Grandmont, C. (10 December 2024). "Introduction aux Jeux sur Graphe à Préférence Automatique" [Paper presentation]. Séminaire Jeunes, Mons, Belgium.
2024-Seminaire_jeunes.pdf - Vandenhove, P. (20 November 2024). "Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives" [Paper presentation]. Journées annuelles du GT Vérif, Lille, France.
vandenhove_gtVerif24.pdf - Staquet, G. (20 November 2024). "Active Learning of Mealy Machines with Timers" [Paper presentation]. WG Verifications & SCALP Days (Journées des GT Vérification et SCALP), Lille, France.
LearningMealyMachinesWithTimers.pdf - Grandmont, C. (21 October 2024). "Automatic Relations: their Properties and Beyond" [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.
Reading_Groups_2024___Synchronized_Relations.pdf - Staquet, G. (20 September 2024). "Active Learning of Mealy Machines with Timers" [Paper presentation]. Highlights of Logic, Games and Automata, Bordeaux, France.
LearningMealyMachinesWithTimers.pdf - Grandmont, C. (19 September 2024). "As Soon as Possible but Rationally: Rational Synthesis for Reachability on Weighted Graphs" [Paper presentation]. Highlights of Logic, Games and Automata, Bordeaux, France.
2024-Highlights.pdf - Grandmont, C. (10 September 2024). "As Soon as Possible but Rationally" [Paper presentation]. CONCUR: International Conference on Concurrency Theory, Calgary, Canada.
2024-CONCUR.pdf - Staquet, G. (30 May 2024). "Active Learning of Mealy Machines with Timers" [Paper presentation]. MOVEP'24: 16th school on modelling and verification of parallel processes, Rennes, France.
LearningMealyMachinesWithTimers.pdf - Grandmont, C. (26 April 2024). "As Soon as Possible but Rationally" [Paper presentation]. WG Data, Automata, Algebra, & Logic Days (Journées du GT DAAL), Rennes, France.
2024-GTDAAL.pdf - Staquet, G. (06 April 2024). "Validating Streaming JSON Documents with Learned Visibly Pushdown Automata" [Paper presentation]. LiVe 2024: 8th Workshop on Learning in Verification, Luxembourg, Luxembourg.
ValidatingJSONDocumentsWithLearnedVPAs.pdf - Grandmont, C. (15 March 2024). "As Soon as Possible but Rationally" [Paper presentation]. Centre Fédéré en Vérification (CFV), Brussels, Belgium.
2024-CFV.pdf - Grandmont, C. (11 March 2024). "Safety Combination and Parikh Automata applied to the Pareto Rational Synthesis" [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.
Reading_Group_2024___Talk_As_Soon_as_Possible.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bose, S., Ibsen-Jensen, R., Purser, D., Totzke, P., & Vandenhove, P. (29 August 2024). The Power of Counting Steps in Quantitative Games. "Leibniz International Proceedings in Informatics, 311", 13:1-13:18. doi:10.4230/LIPIcs.CONCUR.2024.13
LIPIcs.CONCUR.2024.13.pdf
Mémoires et thèses/Thèse de doctorat
- Staquet, G. (2024). "Active Learning of Automata with Resources" [Doctoral thesis, UMONS - Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/49676doi:10.63028/10067/2079640151162165141
thesis.pdf
E-prints, Working papers et Carnets de recherche/Eprint diffusé à l'origine sur un autre site
- Casares, A., Ohlmann, P., & Vandenhove, P. (2024). "A positional Π^0_3-complete objective". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/50145.
2410.14688v1.pdf - Bruyère, V., Garhewal, B., Pérez, G. A., Staquet, G., & Vaandrager, F. W. (2024). "Active Learning of Mealy Machines with Timers". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/50336.
2403.02019v2.pdf
Conférences scientifiques dans des universités ou centres de recherche/Conférence scientifique dans des universités ou centres de recherche
- Staquet, G. (06 December 2024). "Active Learning of Mealy Machines with Timers" [Paper presentation]. Seminary of the Formal Methods and Verification Research Group, Bruxelles, Belgium.
LearningMealyMachinesWithTimers.pdf - Staquet, G. (28 November 2024). "Active Learning of Mealy Machines with Timers" [Paper presentation]. Seminary of the LoVe team, Paris, France.
LearningMealyMachinesWithTimers.pdf - Vandenhove, P. (07 October 2024). "Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives" [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.
vandenhove_readingGroup071024.pdf
2023
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Staquet, G. (15 December 2023). "Automata with Timers" [Paper presentation]. Centre Fédéré en Vérification, Brussels, Belgium.
AutomataWithTimers.pdf - Staquet, G. (30 November 2023). "Automata with Timers" [Paper presentation]. WG Verification Days (Journées du GT Vérification), Paris, France.
AutomataWithTimers.pdf - Grandmont, C. (23 October 2023). "Rational Synthesis on Reachability Objectives through Tree Automata" [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.
Reading_Group_2023___Tree_automata.pdf - Staquet, G. (20 September 2023). "Automata with Timers" [Paper presentation]. International Conference on Formal Modeling and Analysis of Timed Systems, Anvers, Belgium.
AutomataWithTimers.pdf - Staquet, G. (25 July 2023). "Automata with Timers" [Paper presentation]. Highlights of Logic, Games and Automata 2023, Kassel, Germany.
AutomataWithTimers.pdf - Staquet, G. (24 May 2023). "Verification of Computer Systems thanks to State Machines" [Paper presentation]. Day of the research institute INFORTECH, Mons, Belgium.
INFORTECH.pdf - Staquet, G. (24 April 2023). "Validating Streaming JSON Documents with Learned Visibly Pushdown Automata" [Paper presentation]. International Conference on Tools and Algorithms for Construction and Analysis of Systems, Paris, France.
ValidatingJSONDocumentsWithLearnedVPAs.pdf
Colloques et congrès scientifiques/Communication publiée dans un ouvrage
- Bruyère, V., Pérez, G. A., Staquet, G., & Vaandrager, F. W. (2023). Automata with Timers. In L. Petrucci & J. Sproston (Eds.), "Formal Modeling and Analysis of Timed Systems - 21st International Conference, FORMATS 2023, Proceedings". Springer Science and Business Media Deutschland GmbH. doi:10.1007/978-3-031-42626-1_3
2305.07451.pdf - Bruyère, V., Pérez, G. A., & Staquet, G. (2023). Validating Streaming JSON Documents with Learned VPAs. In S. Sankaranarayanan & N. Sharygina, "Tools and Algorithms for the Construction and Analysis of Systems". Springer Nature Switzerland. doi:10.1007/978-3-031-30823-9_14
978-3-031-30823-9_14-1.pdf
Allocutions et communications diverses/Autre
- Capon, C., Goeminne, A., Lecomte, N., Main, J., Randour, M., Staquet, G., Terefenko, A., & Vandenhove, P. (2023). "À vous de jouer !"
JMS2023.pdf
Conférences scientifiques dans des universités ou centres de recherche/Conférence scientifique dans des universités ou centres de recherche
- Staquet, G. (07 November 2023). "Automata with Timers" [Paper presentation]. 68NQRT - Formal Methods Seminar of IRISA and INRIA, Rennes, France.
AutomataWithTimers.pdf - Staquet, G. (10 October 2023). "Automata with Timers" [Paper presentation]. Seminary of the Software Science Department of Radboud Universiteit, Nijmegen, Netherlands.
AutomataWithTimers.pdf
2022
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Staquet, G. (29 June 2022). "Active Learning of Automata for JSON-Streaming Validation" [Paper presentation]. Highlights 2022 of Logic, Games and Automata.
highlights2022.pdf - Staquet, G. (06 May 2022). "Vérifier efficacement un document JSON grâce à un automate" [Paper presentation]. Séminaire Jeune, Mons, Belgium.
mai2022.pdf - Staquet, G. (2022). "Learning Realtime One-Counter Automata" [Paper presentation]. International Conference on Tools and Algorithms for Construction and Analysis of Systems, Munich, Germany.
TACAS2022.pdf - Staquet, G. (2022). "Vérifier un système informatique grâce à un automate" [Paper presentation]. Séminaire Jeune.
seminaireJeuneOctober.pdf - Staquet, G. (2022). "Verification of computer systems thanks to state machines" [Paper presentation]. Annual meeting of the thematic doctoral school COMPLEX.
VerificationOfSystemsByAutomata.pdf
Colloques et congrès scientifiques/Communication publiée dans un ouvrage
- Bruyère, V., Pérez, G., & Staquet, G. (2022). Learning Realtime One-Counter Automata. In D. Fisman & G. Rosu, "Tools and Algorithms for the Construction and Analysis of Systems". Springer International Publishing. doi:10.1007/978-3-030-99524-9_13
tacas.pdf - Bruyère, V. (2022). A Game-Theoretic Approach for the Synthesis of Complex Systems. In "Revolutions and Revelations in Computability". Springer. doi:10.1007/978-3-031-08740-0
Conférences scientifiques dans des universités ou centres de recherche/Conférence scientifique dans des universités ou centres de recherche
- Staquet, G. (26 October 2022). "Learning Realtime One-Counter Automata" [Paper presentation]. Seminary of the LRDE (Laboratoire de Recherche et Développement de l'EPITA), Paris, France.
LearningRealtimeOneCounterAutomata.pdf - Staquet, G. (21 October 2022). "Learning Realtime One-Counter Automata" [Paper presentation]. Formal Methods and Verification (FMV) seminary, Brussels, Belgium.
LearningRealtimeOneCounterAutomata.pdf
2021
Périodiques scientifiques/Article
- Bruyère, V. (30 June 2021). Synthesis of equilibria in infinite-duration games on graphs. "ACM SIGLOG News, 8" (2), 4-29.
main-SIGLOG.pdf - Brihaye, T., Bruyère, V., Goeminne, A., & Thomasset, N. (30 June 2021). On relevant equilibria in reachability games. "Journal of Computer and System Sciences, 119", 211-230.
RP19__VersionLongue.pdf - Bruyère, V., Le Roux, S., Pauly, A., & Raskin, J.-F. (01 January 2021). On the existence of weak subgame perfect equilibria. "Information and Computation, 276".
ICArticleWSPEFinalVersion.pdf - Brihaye, T., Bruyère, V., Goeminne, A., & Raskin, J.-F. (01 January 2021). Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. "Information and Computation, 278" (104594).
version_EPTCS.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Staquet, G. (17 November 2021). "Learning Realtime One-Counter Automata" [Paper presentation]. Journées du GT Vérif, Gif-sur-Yvette, France.
WGVerificationDays.pdf - Tamines, C. (15 September 2021). "Stackelberg-Pareto Synthesis" [Paper presentation]. Highlights of Logic, Games and Automata, Online, Unknown/unspecified.
- Staquet, G. (10 September 2021). "Learning Realtime One-Counter Automata" [Paper presentation]. Highlights of Logic, Games and Automata.
- Tamines, C. (26 August 2021). "Stackelberg-Pareto Synthesis" [Paper presentation]. International Conference on Concurrency Theory, Online, Unknown/unspecified.
- Bruyère, V. (30 June 2021). "A game-theoretic approach for the automated synthesis of complex systems" [Paper presentation]. 'ReLaX' Workshop on Games, Chennai, India.
- Bruyère, V. (30 June 2021). "Nash equilibria and subgame perfect equilibria in reachability games" [Paper presentation]. 'ReLaX' Workshop on Games, Chennai, India.
- Tamines, C. (24 March 2021). "Stackelberg-Pareto Synthesis" [Paper presentation]. MFV seminar - ULB, .
- Staquet, G. (10 March 2021). "L'apprentissage d'automates et ses applications" [Paper presentation]. Les doctorants prennent le pouvoir, Mons, Belgium.
Colloques et congrès scientifiques/Communication publiée dans un ouvrage
- Bruyère, V., Raskin, J.-F., & Tamines, C. (2021). Stackelberg-Pareto Synthesis. In "LIPIcs". Schloss Dagstuhl - Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.CONCUR.2021.27
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V., Raskin, J.-F., & Tamines, C. (2021). "Stackelberg-Pareto Synthesis" [Paper presentation]. International Conference on Concurrency Theory, .
LIPIcs-CONCUR-2021-27.pdf
E-prints, Working papers et Carnets de recherche/Working paper
- Bruyère, V., Pérez, G., & Staquet, G. (2021). "Learning Realtime One-Counter Automata, Long Version". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/14179. doi:10.48550/arXiv.2110.09434
2110.09434.pdf
2020
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V. (30 June 2020). "A game-theoretic approach for the automated synthesis of complex systems" [Paper presentation]. Computability in Europ, Salerno, Italy.
- Tamines, C. (05 March 2020). "La vérification à l'aide des jeux" [Paper presentation]. Séminaire Jeunes (Math-Info), Mons, Belgium.
2019
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V. (01 October 2019). "Computer-aided synthesis: a game-theoretic approach" [Paper presentation]. 26th International Symposium on Temporal Representation and Reasoning, Malaga, Spain.
- Tamines, C. (18 September 2019). "Partial Solvers for Generalized Parity Games" [Paper presentation]. Highlights of Logic, Games and Automata, Warsaw, Poland.
- Tamines, C. (11 September 2019). "Partial Solvers for Generalized Parity Games" [Paper presentation]. 13th International Conference on Reachability Problems (RP'19), Brussels, Belgium.
- Bruyère, V. (01 September 2019). "Energy Mean-Payoff Games" [Paper presentation]. Highlights of Logic, Games and Automata, Warsaw, Poland.
- Tamines, C. (22 June 2019). "Partial Solvers for Generalized Parity Games" [Paper presentation]. 2nd International Workshop on Multi-objective Reasoning in Verification and Synthesis -- MoRe 2019, Vancouver, Canada.
- Bruyère, V. (01 March 2019). "La théorie des jeux en synthèse assistée par ordinateur" [Paper presentation]. Journées Nationales Informatique Mathématique, Orléans, France.
- Bruyère, V. (09 January 2019). "Energy Mean-Payoff Games" [Paper presentation]. International Conference on Concurrency Theory, Amsterdam, Netherlands.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Brihaye, T., Bruyère, V., Goeminne, A., & Thomasset, N. (2019). "On Relevant Equilibria in Reachability Games" [Paper presentation]. Reachability Problems, Brussels, Belgium.
- Bruyère, V., Pérez, G., Raskin, J.-F., & Tamines, C. (2019). "Partial Solvers for Generalized Parity Games" [Paper presentation]. Reachability Problems, Brussels, Belgium.
RP2019_Partial_Solvers_for_Generalized_Parity_Games.pdf - Bruyère, V., Hautem, Q., Randour, M., & Raskin, J.-F. (2019). Energy Mean-Payoff Games. "Leibniz International Proceedings in Informatics, 140", 21:1-21:17. doi:10.4230/LIPIcs.CONCUR.2019.21
1907.01359.pdf
E-prints, Working papers et Carnets de recherche/Working paper
- Bruyère, V., Pérez, G., Raskin, J.-F., & Tamines, C. (2019). "Partial Solvers for Generalized Parity Games". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/36802.
- Brihaye, T., Bruyère, V., Goeminne, A., & Thomasset, N. (2019). "On Relevant Equilibria in Reachability Games". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/39077.
- Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J.-F., & van den Bogaard, M. (2019). "The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/39349.
Allocutions et communications diverses/Autre
- Bruyère, V. (2019). "L'ordinateur face au Sudoku et autres jeux".
- Delgrange, F., Goeminne, A., Hallet, M., Meurisse, Q., Tamines, C., Thomasset, N., Randour, M., & Van Mieghem, K. (2019). "A vous de jouer !"
JMS2019.pdf
2018
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V. (01 June 2018). "Synthesis of subgame perfect equilibria in graph games (invited talk)" [Paper presentation]. GandALF, Saarbrücken, Germany.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Brihaye, T., Bruyère, V., Goeminne, A., & Raskin, J.-F. (2018). "Constrained Existence Problem for Weak Subgame Perfect Equilibria with Omega-Regular Boolean Objectives" [Paper presentation]. International Symposium on Games, Automata, Logics and Formal Verification, Saarbrücken, Germany.
- Bruyère, V., Hautem, Q., & Raskin, J.-F. (2018). "Parameterized complexity of games with monotonically ordered omega-regular objectives" [Paper presentation]. International Conference on Concurrency Theory, Beijing, China.
Rapports/Rapport de recherche interne
- Brihaye, T., Bruyère, V., Goeminne, A., & Raskin, J.-F. (2018). "Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives".
2017
Périodiques scientifiques/Article
- Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (03 July 2017). Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. "Information and Computation, 254", 259-295.
- Bohy, A., Bruyère, V., Raskin, J.-F., & Bertrand, N. (04 January 2017). Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. "Acta Informatica, 54" (6), 545-587.
- Randour, M., Raskin, J.-F., & Sankur, O. (01 January 2017). Percentile Queries in Multi-Dimensional Markov Decision Processes. "Formal Methods in System Design, 50" (2), 207-248. doi:10.1007/s10703-016-0262-7
1410.4801.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Hautem, Q. (05 December 2017). "La Vérification à l'aide des jeux et un aperçu des jeux ordonnés" [Paper presentation]. Séminaire Jeunes (Math-Info), Mons, Belgium.
- Hautem, Q. (13 September 2017). "Games with lexicographically ordered omega-regular objectives" [Paper presentation]. Highlights of Logic, Games and Automata, London, United Kingdom.
- Hautem, Q. (05 May 2017). "Window parity games" [Paper presentation]. Centre Fédéré en Vérification (ULB), Bruxelles, Belgium.
- Bruyère, V. (09 March 2017). "On the existence of weak subgame perfect equilibria" [Paper presentation]. Dagstuhl Seminar 17111, ''Game Theory in AI, Logic, and Algorithms', Schloss Dagstuhl, Wadern, Germany.
- Bruyère, V. (08 January 2017). "Computer aided synthesis: a game theoretic approach" [Paper presentation]. Developments in Language Theory, Liège, Belgium.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V. (2017). "Computer Aided Synthesis: A Game-Theoretic Approach" [Paper presentation]. International Conference on Developments in Language Theory, Liège, Belgium.
- Bruyère, V., Le Roux, S., Pauly, A., & Raskin, J.-F. (2017). "On the existence of weak subgame perfect equilibria" [Paper presentation]. Foundations of Software Science and Computation Structure, Uppsala, Sweden.
Rapports/Rapport de recherche interne
- Bruyère, V., Hautem, Q., & Raskin, J.-F. (2017). "Parameterized complexity of games with monotonically ordered omega-regular objectives".
Article.pdf - Bruyère, V. (2017). "Computer aided synthesis: a game theoretic approach".
Allocutions et communications diverses/Autre
- Bruyère, V., Devillez, G., Hautem, Q., & Mélot, H. (2017). "Sciencebook".
poster.pdf poster1bis.pdf Poster2.pdf Poster3.pdf - Carlier, P., Hallet, M., & Hautem, Q. (2017). "Jouer n'est pas qu'un jeu".
- Bruyère, V. (2017). "L'ordinateur face au Sudoku et autres jeux".
- Bruyère, V. (2017). "La théorie des graphes dans toutes ses couleurs".
2016
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Hautem, Q. (15 September 2016). "Window parity games: an alternative approach toward parity games with time bounds" [Paper presentation]. The seventh international symposium on Games, Automata, Logics and Formal Verification (GANDALF 2016), Catane, Italy.
gandalf.pdf - Hautem, Q. (08 September 2016). "Games with window parity objectives" [Paper presentation]. Highlights of Logic, Games and Automata, Bruxelles, Belgium.
gandalf.pdf - Bruyère, V., Hautem, Q., & Raskin, J.-F. (23 August 2016). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. The 27th International Conference on Concurrency Theory (CONCUR 2016), Québec, Canada, 2016, Québec, Canada.
heterogeneous.pdf - Bruyère, V., Hautem, Q., & Raskin, J.-F. (30 June 2016). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. Summer School MOVEP 2016, Gênes, Italy.
heterogeneous.pdf - Bruyère, V. (17 May 2016). "Algorithmic Aspects of Two-player Zero-sum and Multi-Player Non Zero-sum Games" [Paper presentation]. QuantLA Spring School, Leipzig, Germany.
- Hautem, Q. (03 April 2016). "Games with window parity objectives" [Paper presentation]. Cassting Workshop at ETAPS 2016, Eindhoven, Netherlands.
gandalf.pdf - Bruyère, V. (24 March 2016). "On algorithmic aspects of infinite games played on weighted graphs" [Paper presentation]. Conference dedicated to the scientific legacy of Marcel-Paul Schützenberger, Bordeaux, France.
- Hautem, Q. (18 February 2016). "La Vérification à l'aide des jeux" [Paper presentation]. Séminaire Jeunes (Math-Info) 2016, Mons, Belgium.
Hautem Quentin.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V., Hautem, Q., & Randour, M. (13 September 2016). Window parity games: an alternative approach toward parity games with time bounds. "Electronic Proceedings in Theoretical Computer Science, 226", 135-148. doi:10.4204/EPTCS.226.10
Article.pdf - Bruyère, V., Hautem, Q., & Raskin, J.-F. (2016). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. International Conference on Concurrency Theory, Québec, Canada. doi:10.4230/LIPIcs.CONCUR.2016.11
CONCUR-Article.pdf - Brenguier, R., Clemente, L., Hunter, P., Pérez, G., Randour, M., Raskin, J.-F., Sankur, O., & Sassolas, M. (17 March 2016). Non-Zero Sum Games for Reactive Synthesis. "Lecture Notes in Computer Science, 9618", 3-23. doi:10.1007/978-3-319-30000-9_1
1512.05568.pdf
Rapports/Rapport de recherche interne
- Bruyère, V., & Hautem, Q. (2016). "Window parity games: an alternative approach toward parity games with time bounds".
Article.pdf
Allocutions et communications diverses/Autre
- Hautem, Q. (2016). "Ma thèse en 180s - Quentin Hautem".
Hautem Quentin.pdf - Delgrange, O., Hautem, Q., & Hauweele, D. (2016). "Séquençage d'ADN".
- Bruyère, V. (2016). "La théorie des graphes dans toutes ses couleurs".
- Bruyère, V. (2016). "La théorie des graphes dans toutes ses couleurs".
- Bruyère, V. (2016). "L'ordinateur face au Sudoku et autres jeux".
2015
Périodiques scientifiques/Article
- Chatterjee, K., Doyen, L., Randour, M., & Raskin, J.-F. (01 January 2015). Looking at Mean-Payoff and Total-Payoff through Windows. "Information and Computation, 242", 25-52. doi:10.1016/j.ic.2015.03.010
1302.4248.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V., Hautem, Q., & Raskin, J.-F. (10 December 2015). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. Méthodes formelles et Vérification, Bruxelles (ULB), Belgium.
Hautem Quentin - MFV.pdf - Bruyère, V., Hautem, Q., & Raskin, J.-F. (27 October 2015). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. Sixth Cassting meeting, Cachan, France.
Hautem Quentin - Cassting.pdf - Bruyère, V., Hautem, Q., & Raskin, J.-F. (16 September 2015). "On the complexity of heterogeneous multidimensional quantitative games" [Paper presentation]. Highlights of Logic, Games and Automata, Prague, Czechia.
2 - Hautem.pdf - Brihaye, T., Bruyère, V., Meunier, N., & Raskin, J.-F. (10 September 2015). "Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability" [Paper presentation]. 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), Berlin, Germany.
- Brihaye, T., Bruyère, V., Meunier, N., & Raskin, J.-F. (03 February 2015). "Weak subgame perfect equilibria in quantitative games" [Paper presentation]. Dagstuhl Seminar, 'Non-Zero-Sum-Games and Control', Wadern, Germany.
- Bruyère, V. (01 January 2015). "La théorie des graphes dans toutes ses couleurs" [Paper presentation]. Journées Math-Sciences, Mons, Belgium.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Brihaye, T., Bruyère, V., Meunier, N., & Raskin, J.-F. (2015). "Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability" [Paper presentation]. Annual Conference for Computer Science Logic, Berlin, Germany.
- Randour, M., Raskin, J.-F., & Sankur, O. (12 January 2015). Variations on the Stochastic Shortest Path Problem. "Lecture Notes in Computer Science, 8931", 1-18. doi:10.1007/978-3-662-46081-8_1
1411.0835.pdf - Randour, M., Raskin, J.-F., & Sankur, O. (01 January 2015). Percentile Queries in Multi-Dimensional Markov Decision Processes. "Lecture Notes in Computer Science, 9206", 123-139. doi:10.1007/978-3-319-21690-4_8
1410.4801(1).pdf - Bouyer, P., Markey, N., Randour, M., Larsen, K. G., & Laursen, S. (01 January 2015). Average-energy games. "Electronic Proceedings in Theoretical Computer Science, 193", 1-15. doi:10.4204/EPTCS.193.1
1512.08106(1).pdf
Mémoires et thèses/Thèse de doctorat
- Maslowski, D. (2015). "Dichotomies in the Complexity of Counting Databases Repairs" [Doctoral thesis, Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/21695
E-prints, Working papers et Carnets de recherche/Working paper
- Bruyère, V., Hautem, Q., & Raskin, J.-F. (2015). "On the complexity of heterogeneous multidimensional quantitative games". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/37394.
Article.pdf
Allocutions et communications diverses/Autre
- Bruyère, V., Heuwelyckx, F., & Maslowski, D. (2015). "La récurrence : un petit pas de chacun, un grand pas pour tous".
- Hauweele, P., Meunier, N., & Pijcke, F. (2015). "Quand génétique devient optimisation".
slides.pdf
2014
Périodiques scientifiques/Article
- Battaglia, C., Bruyère, V., Gauwin, O., Pelsser, C., & Quoitin, B. (29 January 2014). Reasoning on BGP Routing Filters using Tree Automata. "Computer Networks, 65", 232-254.
- Oualhadj, Y., Reynier, P.-A., & Sankur, O. (01 January 2014). Probabilistic Robust Timed Games. "Lecture Notes in Computer Science, 8704", 203-217.
- Fijalkow, N., Gimbert, H., Horn, F., & Oualhadj, Y. (01 January 2014). Two Recursively Inseparable Problems for Probabilistic Automata. "Lecture Notes in Computer Science, 8634", 267-278.
- Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (01 January 2014). Perfect-Information Stochastic Mean-Payoff Parity Games. "Lecture Notes in Computer Science, 8412", 210-225.
- Gimbert, H., & Oualhadj, Y. (01 January 2014). Deciding the Value 1 Problem for $sharp$ -acyclic Partially Observable Markov Decision Processes. "Lecture Notes in Computer Science, 8327", 281-292.
- Chatterjee, K., Randour, M., & Raskin, J.-F. (01 January 2014). Strategy Synthesis for Multi-Dimensional Quantitative Objectives. "Acta Informatica, 51", 129-163. doi:10.1007/s00236-013-0182-6
CRR12.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V., Meunier, N., & Raskin, J.-F. (25 November 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. Séminaire graphes et logique, Bordeaux, France.
- Maslowski, D., & Wijsen, J. (17 October 2014). "A Dichotomy in the Complexity of Counting Database Repairs" [Paper presentation]. Dutch Belgian Database Day (DBDBD14), Anvers, Belgium.
- Bruyère, V., Meunier, N., & Raskin, J.-F. (03 September 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. Highlights of Logic, Games and Automata, Paris, France.
- Randour, M. (03 September 2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games" [Paper presentation]. Highlights of Logic, Games and Automata, Paris, France.
HIGHLIGHTS2014.pdf - Bruyère, V., Meunier, N., & Raskin, J.-F. (15 July 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. CSL-LICS, Vienne, Austria.
- Randour, M. (17 June 2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (invited talk)" [Paper presentation]. IST Austria seminar, Klosterneuburg, Austria.
IST2014.pdf - De Pril, J. (10 June 2014). "Equilibria in Multiplayer Cost Games" [Paper presentation]. Dagstuhl Seminar: 'Quantitative Models: Expressiveness, Analysis, and New Applications', Dagstuhl, Germany.
- Bruyère, V., Meunier, N., & Raskin, J.-F. (21 May 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. Third Cassting Meeting, Bruxelles, Belgium.
- Bruyère, V., Meunier, N., & Raskin, J.-F. (12 April 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. 1st Cassting Workshop ETAPS 2014, Grenoble, France.
- Bruyère, V., & Raskin, J.-F. (12 April 2014). "Secure Equilibria in Weighted Games" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
- Randour, M. (05 April 2014). "Expectations or Guarantees? I Want It All! A crossroad between games and MDPs" [Paper presentation]. SR - International Workshop on Strategic Reasoning, Grenoble, France.
SR2014.pdf - Randour, M. (05 March 2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games" [Paper presentation]. STACS - Symposium on Theoretical Aspects of Computer Science, Lyon, France.
STACS2014.pdf - De Pril, J. (24 January 2014). "Equilibria in Multiplayer Cost Games" [Paper presentation]. Dagstuhl Seminar: 'Quantitative Models: Expressiveness, Analysis, and New Applications', Dagstuhl, Germany.
- Randour, M. (23 January 2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (invited talk)" [Paper presentation]. GT Jeux - annual meeting, Paris, France.
GTJeux2014.pdf - Randour, M. (16 January 2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (invited talk)" [Paper presentation]. LaBRI verification seminar, Bordeaux, France.
LaBRI2014.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V., Meunier, N., & Raskin, J.-F. (2014). "Secure Equilibria in Weighted Games" [Paper presentation]. Annual Conference for Computer Science Logic, Vienne, Austria.
- Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (05 April 2014). Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. "Electronic Proceedings in Theoretical Computer Science, 146", 1-8. doi:10.4204/EPTCS.146.1
1404.0834.pdf - Maslowski, D., & Wijsen, J. (2014). "Counting database repairs that satisfy conjunctive queries with self-joins" [Paper presentation]. 17th International Conference on Database Theory (ICDT14), Athènes, Greece.
- Bohy, A., Bruyère, V., & Raskin, J.-F. (2014). "Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes" [Paper presentation]. Workshop on Synthesis, SYNT, Vienne, Austria.
Rapports/Rapport de recherche interne
- Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (2014). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games".
BFRR14.pdf
Mémoires et thèses/Thèse de doctorat
- Randour, M. (2014). "Synthesis in Multi-Criteria Quantitative Games" [Doctoral thesis, Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/33300
thesis.pdf
2013
Périodiques scientifiques/Article
- Maslowski, D., & Wijsen, J. (31 December 2013). A Dichotomy in the Complexity of Counting Database Repairs. "Journal of Computer and System Sciences, 79" (6), 958-983. doi:10.1016/j.jcss.2013.01.011
YJCSS2659.pdf - Brihaye, T., Bruyère, V., De Pril, J., & Gimbert, H. (25 January 2013). On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games. "Logical Methods in Computer Science, 9" (1).
- Brihaye, T., Bruyère, V., & De Pril, J. (04 January 2013). On Equilibria in Quantitative Games with Reachability/Safety Objectives. "Theory of Computing Systems, 54" (2), 150-189. doi:10.1007/s00224-013-9495-7
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bruyère, V., Meunier, N., & Raskin, J.-F. (17 December 2013). "Quantitative Secure Equilibria" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
- Randour, M. (16 December 2013). "Looking at Mean-Payoff and Total-Payoff through Windows (invited talk)" [Paper presentation]. LIAFA verification seminar, Paris, France.
LIAFA2013.pdf - Randour, M. (26 November 2013). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (invited talk)" [Paper presentation]. LSV seminar, ENS Cachan, France.
LSV2013.pdf - Randour, M. (19 November 2013). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
MFV2013_2.pdf - Randour, M. (28 October 2013). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games (invited talk)" [Paper presentation]. Nord Pas de Calais / Belgium Congress of Mathematics, Valenciennes, France.
NPCB2013.pdf - Randour, M. (16 October 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. ATVA - International Symposium on Automated Technology for Verification and Analysis, Hanoï, Vietnam.
ATVA2013.pdf - Randour, M. (01 October 2013). "Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games" [Paper presentation]. Second Cassting Meeting, Aalborg, Denmark.
CASSTING2013_2.pdf - Ducobu, M. (26 September 2013). "Right-Universality of Visibly Pushdown Automata" [Paper presentation]. Runtime Verification, Rennes, France.
- Randour, M. (20 September 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. Highlights of Logic, Games and Automata, Paris, France.
HIGHLIGHTS2013.pdf - Randour, M. (09 May 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. ERC Workshop on Quantitative Models, Jerusalem, Israel.
ERC2013.pdf - Randour, M. (12 April 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. CASSTING European Project kick-off meeting, Paris, France.
CASSTING2013.pdf - Ducobu, M. (04 April 2013). "Visibly Pushdown Automata: Universality and Inclusion via Antichains" [Paper presentation]. 7th International Conference on Language and Automata Theory and Applications (LATA 2013), Bilbao, Spain.
- Randour, M. (29 March 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. Centre Fédéré en Vérification, Bruxelles, Belgium.
CFV2013.pdf - Bohy, A., Bruyère, V., Raskin, J.-F., & Filiot, E. (19 March 2013). "Synthesis from LTL Specifications with Mean-Payoff Objectives" [Paper presentation]. 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Rome, Italy.
- Randour, M. (08 February 2013). "Looking at Mean-Payoff and Total-Payoff through Windows" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
MFV2013.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Chatterjee, K., Doyen, L., Randour, M., & Raskin, J.-F. (16 October 2013). Looking at Mean-Payoff and Total-Payoff through Windows. "Lecture Notes in Computer Science, 8172", 118-132. doi:10.1007/978-3-319-02444-8_10
1302.4248(1).pdf - Jerraya, A. A., Romdhani, M., Le Marrec, P., Hessel, F., Coste, P., Valderrama, C., Daveau, M., & Zergainoh, N.-E. (2013). "Right-Universality of Visibly Pushdown Automata" [Paper presentation]. Runtime Verification, Rennes, France.
- Bruyère, V., Ducobu, M., & Gauwin, O. (2013). "Visibly Pushdown Automata: Universality and Inclusion via Antichains" [Paper presentation]. Language and Automata Theory and Applications, Bilbao, Spain.
- Bohy, A., Bruyère, V., Filiot, E., & Raskin, J.-F. (2013). "Synthesis from LTL Specifications with Mean-Payoff Objectives" [Paper presentation]. International Conference on Tools and Algorithms for Construction and Analysis of Systems, Rome, Italy.
Mémoires et thèses/Thèse de doctorat
- Ducobu, M. (2013). "Antichains for QBF evaluation and VPA decision problems" [Doctoral thesis, Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/35806
- De Pril, J. (2013). "Equilibria in Multiplayer Cost Games" [Doctoral thesis, Université de Mons]. ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/4247
Allocutions et communications diverses/Autre
- Randour, M. (2013). "Jouer n'est pas qu'un jeu !"
JMS2013.pdf
2012
Périodiques scientifiques/Article
- Brihaye, T., Bruyère, V., & Mélot, H. (2012). Non, les ordinateurs ne seront jamais tout-puissants ! "Interstices".
- Bruyère, V., Joret, G., & Mélot, H. (01 March 2012). Trees with Given Stability Number and Minimum Number of Stable Sets. "Graphs and Combinatorics, 28" (2), 167-187.
GraphComb_onlineFirst_2011.pdf AsPublished.pdf - Bruyère, V., Carton, O., Decan, A., Gauwin, O., & Wijsen, J. (01 January 2012). An Aperiodicity Problem for Multiwords. "RAIRO: Informatique Théorique et Applications, 46" (1), 33-50.
ita100049_tap.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Ducobu, M. (24 September 2012). "Visibly pushdown automata on trees: universality and u-universality" [Paper presentation]. CFV seminar, Bruxelles, Belgium.
- Bohy, A., Bruyère, V., Raskin, J.-F., & Filiot, E. (21 September 2012). "Synthesis from LTL specifications with mean-payoff objectives" [Paper presentation]. GT Jeux, Cachan, France.
- Ducobu, M. (12 September 2012). "Visibly pushdown automata on trees: universality and u-universality" [Paper presentation]. Mons Days of Theoretical Computer Science, Louvain-la-Neuve, Belgium.
- Battaglia, C., Bruyère, V., Gauwin, O., & Quoitin, B. (11 September 2012). "Reasoning on BGP Routing Filters Using Tree Automata" [Paper presentation]. Journées Montoises d'Informatique Théorique, Louvain-la-Neuve, Belgium.
- Randour, M. (04 September 2012). "Strategy Synthesis for Multi-dimensional Quantitative Objectives" [Paper presentation]. CONCUR - International Conference on Concurrency Theory, Newcastle, United Kingdom.
CONCUR2012.pdf - Randour, M. (03 September 2012). "Automated synthesis of reliable and efficient systems through game theory: a case study" [Paper presentation]. ECCS - European Conference on Complex Systems, Brussels, Belgium.
ECCS2012.pdf - Bohy, A., Bruyère, V., Filiot, E., & Raskin, J.-F. (10 July 2012). "Acacia+, a Tool for LTL Synthesis" [Paper presentation]. CAV - Computer Aided Verification, Berkeley, United States - California.
- Randour, M. (08 June 2012). "Strategy Synthesis for Multi-dimensional Quantitative Objectives" [Paper presentation]. ERC-Workshop on Quantitative and Game Models for the Synthesis of Reactive Systems, Bruxelles, Belgium.
ERC2012.pdf - Bohy, A., Bruyère, V., Raskin, J.-F., Filiot, E., & Jin, N. (07 June 2012). "Synthesis from LTL and mean-payoff objectives" [Paper presentation]. Quantitative models for verification and synthesis, Bruxelles, Belgium.
- Bohy, A., Bruyère, V., Raskin, J.-F., Filiot, E., & Jin, N. (06 June 2012). "Acacia+, a Tool for LTL Synthesis" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
- Randour, M. (18 April 2012). "Strategy Synthesis for Multi-dimensional Quantitative Objectives" [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.
MFV2012.pdf - Bruyère, V. (13 March 2012). "L'ordinateur face au Sudoku et autres jeux" [Paper presentation]. Journées Math-Sciences, Mons, Belgium.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Chatterjee, K., Randour, M., & Raskin, J.-F. (04 September 2012). Strategy Synthesis for Multi-dimensional Quantitative Objectives. "Lecture Notes in Computer Science, 7454", 115-131. doi:10.1007/978-3-642-32940-1_10
CRR12.pdf - Randour, M. (03 September 2012). Automated synthesis of reliable and efficient systems through game theory: a case study. "Springer Proceedings in Complexity, XVII", 731-738. doi:10.1007/978-3-319-00395-5_90
Randour12.pdf - Bohy, A., Bruyère, V., Raskin, J.-F., Filiot, E., & Jin, N. (2012). "Acacia+, a Tool for LTL Synthesis" [Paper presentation]. International Conference on Computer Aided Verification, Berkeley, United States - California.
- Brihaye, T., Bruyère, V., De Pril, J., & Gimbert, H. (2012). "Subgame Perfection for Equilibria in Quantitative Reachability Games" [Paper presentation]. Foundations of Software Science and Computation Structure, Tallinn, Estonia.
E-prints, Working papers et Carnets de recherche/Working paper
- Bruyère, V., Ducobu, M., & Gauwin, O. (2012). "Visibly pushdown automata on trees: universality and u-universality". ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/27348.
2011
Périodiques scientifiques/Compte rendu et recension critique d’ouvrage
- Delgrange, O. (01 March 2011). Complexité des données et compression informatique. "Élement: le Magazine de l'Université de Mons, 5", 26-28.
Element05-Delgrange.pdf
Périodiques scientifiques/Article
- Brihaye, T., Bruyère, V., & Mélot, H. (01 March 2011). Non, les ordinateurs ne seront jamais tout-puissants! : Magazine Elément 05. "Élement: le Magazine de l'Université de Mons, 5".
Element_05.pdf
Colloques et congrès scientifiques/Communication orale non publiée/Abstract
- Bohy, A., Bruyère, V., Raskin, J.-F., Filiot, E., & Jin, N. (30 November 2011). "Acacia+, a Tool for LTL Synthesis" [Paper presentation]. Gasics Meeting, Bruxelles, Belgium.
- Randour, M. (30 November 2011). "Strategy Synthesis for Quantitative Objectives" [Paper presentation]. Gasics Meeting, Bruxelles, Belgium.
GASICS2011.pdf - De Pril, J. (17 September 2011). "Nash Equilibrium in Quantitative Games Played on Graphs" [Paper presentation]. LogICCC Final Conference, Berlin, Germany.
- Ducobu, M. (05 April 2011). "Antichain-based QBF Solving" [Paper presentation]. Déjeuners Informatiques de l'UMONS, UMONS, Belgium.
- Ducobu, M. (11 February 2011). "Antichain-based QBF solving" [Paper presentation]. CFV seminar, Bruxelles, Belgium.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Maslowski, D., & Wijsen, J. (2011). "Uncertainty That Counts" [Paper presentation]. Flexible Query Answering Systems (FQAS), Ghent, Belgium.
UncertaintyThatCounts.pdf - Brihaye, T., Bruyère, V., Doyen, L., Ducobu, M., & Raskin, J.-F. (2011). "Antichain-Based QBF Solving" [Paper presentation]. Automated Technology for Verification and Analysis, Taipei, Taiwan.
BruyereATVA2011.pdf - Maslowski, D., & Wijsen, J. (2011). "On counting database repairs" [Paper presentation]. Logic in Databases (LID), Uppsala, Sweden.
p15-maslowski.pdf
Colloques et congrès scientifiques/Communication poster
- Ducobu, M. (22 March 2011). "Antichain-based QBF solving" [Poster presentation]. Matinée des chercheurs, UMONS, Belgium.
Développements informatiques/Autre
- Delgrange, O. (2011). "Complexité des données et compression informatique : Interstices.Info, Lien : http://interstices.info/complexite-compression".
Allocutions et communications diverses/Autre
- Delgrange, O. (2011). "Algorithme et efficacité : un petit survol grâce au problème du nombre manquant : Compte-rendus de la Journée de Mathématiques et de Sciences, Université de Mons".
TransparentsNombreManquant2011-1x2.pdf
2010
Périodiques scientifiques/Article
- Brihaye, T., Bruyère, V., & Render, E. (11 February 2010). Formal languages properties of o-minimal hybrid systems. "RAIRO: Informatique Théorique et Applications, 44" (1), 79-111. doi:10.1051/ita/2010006
ita09037.pdf - Boigelot, B., Brusten, J., & Bruyère, V. (01 February 2010). On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. "Logical Methods in Computer Science, 6", 17. doi:10.2168/LMCS-6(1:6)2010
Bruyere-2010-13-journal.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Brihaye, T., Bruyère, V., & De Pril, J. (2010). "Equilibria in Quantitative Reachability Games" [Paper presentation]. Computer Science Symposium in Russia, Kazan, Russia. doi:10.1007/978-3-642-13182-0_7
BRIHAYE-2010-17-JOUNRAL.pdf - Bagan, G., Durand, A., Filiot, E., & Gauwin, O. (2010). "Efficient Enumeration for Conjunctive Queries over X-underbar Structures" [Paper presentation]. 19th EACSL Annual Conference on Computer Science Logic (CSL'10), Brno, Unknown/unspecified. doi:10.1007/978-3-642-15205-4_10
2009
Périodiques scientifiques/Compte rendu et recension critique d’ouvrage
- Delgrange, O. (2009). Bioinformatique : Un domaine pluridisciplinaire. "Élement: le Magazine de l'Université de Mons", (03), 27-30.
Element-BioInfo.pdf
Périodiques scientifiques/Article
- Baeza-Yates, R., Bruyère, V., Delgrange, O., & Scheihing, R. (01 October 2009). On the size of Boyer-Moore automata. "Theoretical Computer Science, 410" (43), 4432-4443.
DELGRANGE-2009-1-JOURNAL.pdf - Bruyère, V., & Mélot, H. (01 May 2009). Fibonacci index and stability number of graphs: a polyhedral study. "Journal of Combinatorial Optimization, 18", 207 - 228.
Bruyere-2009-10-journal.pdf - Bruyère, V., Carton, O., & Sénizergues, G. (01 April 2009). Tree automata and automata on linear orderings. "RAIRO: Informatique Théorique et Applications, 43", 321-338. doi:10.1051/ita/2009009
Bruyere-2008-11-journal.pdf
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V., Decan, A., & Wijsen, J. (2009). "On first-order query rewriting for incomplete database histories" [Paper presentation]. International Symposium/Workshop on Temporal Representation and Reasoning, Bressanone-Brixen, Italy.
wijsen-2009-5-TIME.pdf
2008
Périodiques scientifiques/Article
- Bruyère, V., & Mélot, H. (01 August 2008). Turan graphs, stability number, and fibonacci index. "Lecture Notes in Computer Science, 5165", 127-138. doi:10.1007/978-3-540-85097-7_12
Bruyere-2008-8-journal.pdf - Boigelot, B., Brusten, J., & Bruyère, V. (01 July 2008). On the sets of real numbers recognized by finite automata in multiple bases. "Lecture Notes in Computer Science, 5126", 112-123. doi:10.1007/978-3-540-70583-3_10
Bruyere-2008-9-journal.pdf - Bruyère, V., Dall'Olio, E., & Raskin, J.-F. (01 March 2008). Durations and Parametric Model-Checking in Timed Automata. "ACM Transactions on Computational Logic, 9" (7), 23. doi:10.1145/1342991.1342996
Bruyere-2008-7-journal.pdf
2007
Périodiques scientifiques/Article
- Bouyer, P., Brihaye, T., Bruyère, V., & Raskin, J.-F. (01 October 2007). On the optimal reachability problem of weighted timed automata. "Formal Methods in System Design, 31" (Issue 2), 135-175. doi:10.1007/s10703-007-0035-4
BRIHAYE-2007-07-JOURNAL.pdf - Bruyère, V., & Raskin, J.-F. (01 February 2007). Real-Time Model-Checking: Parameters everywhere. "Logical Methods in Computer Science, 3", 29. doi:10.2168/LMCS-3(1:7)2007
Bruyere-2007-6-journal.pdf - Bruyère, V., & Carton, O. (01 February 2007). Automata on Linear Orderings. "Journal of Computer and System Sciences, 73", 1--24. doi:10.1016/j.jcss.2006.10.009
Bruyere-2007-5-journal.pdf
2006
Périodiques scientifiques/Article
- Brihaye, T., Bruyère, V., & Raskin, J.-F. (01 March 2006). On model-checking timed automata with stopwatch observers. "Information and Computation, 204" (Issue 3), 408-433. doi:10.1016/j.ic.2005.12.001
BRIHAYE-2006-05-JOURNAL.pdf
2005
Périodiques scientifiques/Article
- Bruyère, V., & Carton, O. (01 September 2005). Hierarchy Among Automata on Linear Orderings. "Theory of Computing Systems, 38", 593-621.
Bruyere-2005-4-journal.pdf - Brihaye, T., Bruyère, V., & Raskin, J.-F. (01 September 2005). On optimal timed strategies. "Lecture Notes in Computer Science, 3829", 49-64. doi:10.1007/11603009_5
BRIHAYE-2005-02-JOURNAL.pdf - Araújo, I. M., & Bruyère, V. (01 August 2005). Sturmian words: dynamical systems and derivated words. "Lecture Notes in Computer Science, 3572", 122-133.
Bruyere-2005-3-journal.pdf - Araújo, I. M., & Bruyère, V. (01 June 2005). Sturmian words and a criterium by Michaux-Villemaire. "Theoretical Computer Science, 339", 88-102.
Bruyere-2005-2-journal.pdf - Araújo, I. M., & Bruyère, V. (01 June 2005). Words derivated from Sturmian words. "Theoretical Computer Science, 340", 204-219.
Bruyere-2005-1-journal.pdf
2004
Périodiques scientifiques/Article
- Brihaye, T., & Bruyère, V. (01 January 2004). Model-Checking for Weighted Timed Automata. "Lecture Notes in Computer Science, 3253", 277-292.
2003
Périodiques scientifiques/Article
- Bruyère, V. (01 January 2003). Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. "Lecture Notes in Computer Science, 2607", 687-698.
- Bruyère, V. (01 January 2003). Cumulative defect. "Theoretical Computer Science, 292" (1), 97-109.
- Bruyère, V., & Raskin, J.-F. (01 January 2003). Real-Time Model-Checking: Parameters Everywhere. "Lecture Notes in Computer Science, 2914", 100-111.
2002
Parties d’ouvrages/Contribution à des ouvrages collectifs
- Bruyère, V. (2002). Codes. In "Algebraic Combinatorics on Words" (pp. 30). Cambridge University Press.
Périodiques scientifiques/Article
- Bruyère, V., & Carton, O. (01 January 2002). Automata on Linear Orderings. "Lecture Notes in Computer Science, 2450", 103-115.
Colloques et congrès scientifiques/Communication publiée dans un périodique
- Bruyère, V., & Carton, O. (2002). "Hierarchy Among Automata on Linear Orderings" [Paper presentation]. IFIP International Conference on Theoretical Computer Science (TCS 2002), Montréal, Québec, Canada.
2001
Périodiques scientifiques/Article
- Bruyère, V., & Carton, O. (01 January 2001). Automata on Linear Orderings. "Lecture Notes in Computer Science, 2136", 236-247.