Back
  1. Home
  2. Profile of Véronique Bruyère (UMONS)
Profil

Bruyère Véronique

Université de Mons - UMONS > Faculté des Sciences > Service d'Informatique théorique

ORCID
0000-0002-9680-9140
Main Referenced Co-authors
Raskin, Jean-François (58)
BRIHAYE, Thomas  (26)
Filiot, Emmanuel (13)
Hautem, Quentin  (13)
Bohy, Aaron  (10)
Main Referenced Keywords
Active learning (2); Computer Science (all) (2); Pareto-optimality (2); Quantitative reachability objectives (2); Rational verification (2);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (95)
Main Referenced Disciplines
Electrical & electronics engineering (112)
Mathematics (28)
Computer science (17)
Library & information sciences (1)

Publications (total 131)

The most downloaded
73 downloads
Bruyère, V., Devillez, G., Hautem, Q., & Mélot, H. (2017). Sciencebook. https://hdl.handle.net/20.500.12907/6448

The most cited

100 citations (Scopus®)

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. https://hdl.handle.net/20.500.12907/18999

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
Peer reviewed

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.

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
Peer reviewed

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
Peer reviewed

Brihaye, T., Bruyère, V., & Reghem, G. (2023). Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. In O. Bournez (Ed.), Reachability Problems - 17th International Conference, RP 2023, Proceedings. Springer Science and Business Media Deutschland GmbH. doi:10.1007/978-3-031-45286-4_6
Peer reviewed

Bruyère, V., Raskin, J.-F., & Tamines, C. (2022). Pareto-Rational Verification. In B. Klin (Ed.), 33rd International Conference on Concurrency Theory, CONCUR 2022 (pp. 33:1--33:20). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. doi:10.4230/LIPIcs.CONCUR.2022.33
Peer reviewed

Bruyère, V. (22 July 2022). Stackelberg-Pareto synthesis and verification [Paper presentation]. Workshop on Stochastic Games: Theory and Computational aspects, Stony Brook, United States.

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
Peer reviewed

Bruyère, V. (2022). A Game-Theoretic Approach for the Automated Synthesis of Complex Systems [Paper presentation]. CIE 2022, Special session on reachability problems, Swansea, United Kingdom.

Bruyère, V., Baptiste Fiévet, Jean-François Raskin, & Tamines, C. (2022). Stackelberg-Pareto Synthesis (Extended Version). ORBi UMONS-University of Mons. https://orbi.umons.ac.be/handle/20.500.12907/42995. doi:10.48550/arXiv.2203.01285

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
Peer reviewed

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

Bruyère, V., Raskin, J.-F., & Tamines, C. (2021). Stackelberg-Pareto Synthesis [Paper presentation]. International Conference on Concurrency Theory, .

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.

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.
Peer Reviewed verified by ORBi

Bruyère, V. (30 June 2021). Nash equilibria and subgame perfect equilibria in reachability games [Paper presentation]. 'ReLaX' Workshop on Games, Chennai, India.

Bruyère, V. (30 June 2021). Synthesis of equilibria in infinite-duration games on graphs. ACM SIGLOG News, 8 (2), 4-29.
Peer reviewed

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.
Peer Reviewed verified by ORBi

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).
Peer Reviewed verified by ORBi

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
Peer reviewed

Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J.-F., & van den Bogaard, M. (05 November 2020). The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Logical Methods in Computer Science, 16 (4), 8:1-8:43.
Peer Reviewed verified by ORBi

Bruyère, V. (30 June 2020). A game-theoretic approach for the automated synthesis of complex systems [Paper presentation]. Computability in Europ, Salerno, Italy.

Bruyère, V. (2019). L'ordinateur face au Sudoku et autres jeux.

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.

Bruyère, V. (01 September 2019). Energy Mean-Payoff Games [Paper presentation]. Highlights of Logic, Games and Automata, Warsaw, Poland.

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 [Paper presentation]. International Conference on Concurrency Theory, Amsterdam, Netherlands.

Brihaye, T., Bruyère, V., Goeminne, A., & Thomasset, N. (2019). On Relevant Equilibria in Reachability Games [Paper presentation]. Reachability Problems, Brussels, Belgium.

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.

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.

Bruyère, V., Pérez, G., Raskin, J.-F., & Tamines, C. (2019). Partial Solvers for Generalized Parity Games [Paper presentation]. Reachability Problems, Brussels, Belgium.

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
Peer Reviewed verified by ORBi

Brihaye, T., Bruyère, V., Goeminne, A., & Raskin, J.-F. (2018). Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives. https://orbi.umons.ac.be/handle/20.500.12907/40058

Bruyère, V. (01 June 2018). Synthesis of subgame perfect equilibria in graph games (invited talk) [Paper presentation]. GandALF, Saarbrücken, Germany.

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.

Bruyère, V., Hautem, Q., & Raskin, J.-F. (2017). Parameterized complexity of games with monotonically ordered omega-regular objectives. https://orbi.umons.ac.be/handle/20.500.12907/9808

Bruyère, V. (2017). Computer aided synthesis: a game theoretic approach. https://orbi.umons.ac.be/handle/20.500.12907/37672

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., 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.
Peer Reviewed verified by ORBi

Bruyère, V., Devillez, G., Hautem, Q., & Mélot, H. (2017). Sciencebook.

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. (2017). L'ordinateur face au Sudoku et autres jeux.

Bruyère, V. (2017). La théorie des graphes dans toutes ses couleurs.

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.

Bruyère, V. (08 January 2017). Computer aided synthesis: a game theoretic approach [Paper presentation]. Developments in Language Theory, Liège, Belgium.

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.
Peer Reviewed verified by ORBi

Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (01 January 2017). Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. Information and Computation, 254, 259-295. doi:10.1016/j.ic.2016.10.011
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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

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.

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.

Bruyère, V., & Hautem, Q. (2016). Window parity games: an alternative approach toward parity games with time bounds. https://orbi.umons.ac.be/handle/20.500.12907/4239

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.

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.

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.

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.

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.

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.

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.

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. (2015). Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability [Paper presentation]. Annual Conference for Computer Science Logic, Berlin, Germany.

Bruyère, V., Heuwelyckx, F., & Maslowski, D. (2015). La récurrence : un petit pas de chacun, un grand pas pour tous.

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.

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.

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.

Bruyère, V., Meunier, N., & Raskin, J.-F. (15 July 2014). Secure Equilibria in Weighted Games [Paper presentation]. CSL-LICS, Vienne, Austria.

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., 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.

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
Peer Reviewed verified by ORBi

Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (2014). Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. https://orbi.umons.ac.be/handle/20.500.12907/4299

Bruyère, V., Filiot, E., Randour, M., & Raskin, J.-F. (March 2014). Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games. Leibniz International Proceedings in Informatics, 25, 199-213. doi:10.4230/LIPIcs.STACS.2014.199
Peer Reviewed verified by ORBi

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.
Peer Reviewed verified by ORBi

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.

Bruyère, V., Meunier, N., & Raskin, J.-F. (17 December 2013). Quantitative Secure Equilibria [Paper presentation]. Méthodes Formelles et Vérification, Bruxelles, Belgium.

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.

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).
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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.

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.

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.

Brihaye, T., Bruyère, V., & Mélot, H. (2012). Non, les ordinateurs ne seront jamais tout-puissants ! Interstices.

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.

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.

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.

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.

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.

Bruyère, V. (13 March 2012). L'ordinateur face au Sudoku et autres jeux [Paper presentation]. Journées Math-Sciences, Mons, Belgium.

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.
Peer Reviewed verified by ORBi

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.
Peer Reviewed verified by ORBi

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.

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.

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.

Bruyère, V., Carton, O., Decan, A., Gauwin, O., & Wijsen, J. (2010). A Variant of Pattern Matching for Multiwords [Paper presentation]. Journées Montoises en Informatique Théorique, Amiens, France.

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, 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
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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.
Peer Reviewed verified by ORBi

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.

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.
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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
Peer reviewed

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
Peer reviewed

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
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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
Peer Reviewed verified by ORBi

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
Peer reviewed

Bruyère, V., & Carton, O. (01 September 2005). Hierarchy Among Automata on Linear Orderings. Theory of Computing Systems, 38, 593-621.
Peer Reviewed verified by ORBi

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.
Peer reviewed

Araújo, I. M., & Bruyère, V. (01 June 2005). Words derivated from Sturmian words. Theoretical Computer Science, 340, 204-219.
Peer Reviewed verified by ORBi

Araújo, I. M., & Bruyère, V. (01 June 2005). Sturmian words and a criterium by Michaux-Villemaire. Theoretical Computer Science, 339, 88-102.
Peer Reviewed verified by ORBi

Brihaye, T., Bruyère, V., & Raskin, J.-F. (2004). Model-Checking for Weighted Timed Automata. Lecture Notes in Computer Science.
Editorial Reviewed verified by ORBi

Brihaye, T., & Bruyère, V. (01 January 2004). Model-Checking for Weighted Timed Automata. Lecture Notes in Computer Science, 3253, 277-292.
Peer reviewed

Bruyère, V., & Raskin, J.-F. (01 January 2003). Real-Time Model-Checking: Parameters Everywhere. Lecture Notes in Computer Science, 2914, 100-111.
Peer reviewed

Bruyère, V. (01 January 2003). Cumulative defect. Theoretical Computer Science, 292 (1), 97-109.
Peer Reviewed verified by ORBi

Bruyère, V. (01 January 2003). Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. Lecture Notes in Computer Science, 2607, 687-698.
Peer reviewed

Bruyère, V. (2002). Codes. In Algebraic Combinatorics on Words (pp. 30). Cambridge University Press.

Bruyère, V., & Carton, O. (01 January 2002). Automata on Linear Orderings. Lecture Notes in Computer Science, 2450, 103-115.
Peer reviewed

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.

Bruyère, V., & Carton, O. (01 January 2001). Automata on Linear Orderings. Lecture Notes in Computer Science, 2136, 236-247.
Peer reviewed

Contact ORBi UMONS