Message Sequence Charts. - Blaise Genest; Anca Muscholl; Doron A. Peled (Lectures on Concurrency and Petri Nets, 2003)

High-Level Message Sequence Charts and Projections. - Blaise Genest; Loïc Hélouët; Anca Muscholl (CONCUR, 2003)

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. - Blaise Genest; Anca Muscholl; Dietrich Kuske (Developments in Language Theory, 2004)

Specifying and Verifying Partial Order Properties Using Template MSCs. - Blaise Genest; Marius Minea; Anca Muscholl; Doron A. Peled (FoSSaCS, 2004)

Message Sequence Charts: A Survey. - Blaise Genest; Anca Muscholl (ACSD, 2005)

On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. - Blaise Genest (CONCUR, 2005)

Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs. - Blaise Genest (TACAS, 2005)

Snapshot Verification. - Blaise Genest; Dietrich Kuske; Anca Muscholl; Doron A. Peled (TACAS, 2005)

Grey-Box Checking. - Edith Elkind; Blaise Genest; Doron A. Peled; Hongyang Qu 001 (FORTE, 2006)

Constructing Exponential-Size Deterministic Zielonka Automata. - Blaise Genest; Anca Muscholl (ICALP (2), 2006)

A Kleene theorem and model checking algorithms for existentially bounded communicating automata. - Blaise Genest; Dietrich Kuske; Anca Muscholl (Inf. Comput., 2006)

Infinite-state high-level MSCs: Model-checking and realizability. - Blaise Genest; Anca Muscholl; Helmut Seidl; Marc Zeitoun (J. Comput. Syst. Sci., 2006)

Detecting Races in Ensembles of Message Sequence Charts. - Edith Elkind; Blaise Genest; Doron A. Peled (TACAS, 2007)

On Communicating Automata with Bounded Channels. - Blaise Genest; Dietrich Kuske; Anca Muscholl (Fundam. Informaticae, 2007)

Tree Pattern Rewriting Systems. - Blaise Genest; Anca Muscholl; Olivier Serre; Marc Zeitoun (ATVA, 2008)

Products of Message Sequence Charts. - Philippe Darondeau; Blaise Genest; Loïc Hélouët (FoSSaCS, 2008)

Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination. - Debmalya Biswas; Thomas Gazagnaire; Blaise Genest (HASE, 2008)

Minimal Observability for Transactional Hierarchical Services. - Debmalya Biswas; Blaise Genest (SEKE, 2008)

Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides - Nathalie Bertrand 001; Blaise Genest; Hugo Gimbert (CoRR, 2008)

Pattern Matching and Membership for Hierarchical Message Sequence Charts. - Blaise Genest; Anca Muscholl (Theory Comput. Syst., 2008)

Atomicity for XML Databases. - Debmalya Biswas; Ashwin Jiwane; Blaise Genest (XSym, 2009)

On commutativity based Edge Lean search. - Dragan Bosnacki; Edith Elkind; Blaise Genest; Doron A. Peled (Ann. Math. Artif. Intell., 2009)

Causal Message Sequence Charts. - Thomas Gazagnaire; Blaise Genest; Loïc Hélouët; P. S. Thiagarajan; Shaofa Yang (Theor. Comput. Sci., 2009)

Verifying Recursive Active Documents with Positive Data Tree Rewriting. - Blaise Genest; Anca Muscholl; Zhilin Wu (FSTTCS, 2010)

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2010)

Quasi-static scheduling of communicating tasks. - Philippe Darondeau; Blaise Genest; P. S. Thiagarajan; Shaofa Yang (Inf. Comput., 2010)

Quantifying the Discord: Order Discrepancies in Message Sequence Charts. - Edith Elkind; Blaise Genest; Doron A. Peled; Paola Spoletini (Int. J. Found. Comput. Sci., 2010)

A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways. - Sucheendra K. Palaniappan; S. Akshay 001; Blaise Genest; P. S. Thiagarajan (CMSB, 2011)

Minimal Disclosure in Partially Observable Markov Decision Processes. - Nathalie Bertrand 001; Blaise Genest (FSTTCS, 2011)

Symbolically Bounding the Drift in Time-Constrained MSC Graphs. - S. Akshay 001; Blaise Genest; Loïc Hélouët; Shaofa Yang (ICTAC, 2012)

Regular set of representatives for time-constrained MSC graphs. - S. Akshay 001; Blaise Genest; Loïc Hélouët; Shaofa Yang (Inf. Process. Lett., 2012)

A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. - Sucheendra K. Palaniappan; S. Akshay 001; Bing Liu 013; Blaise Genest; P. S. Thiagarajan (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Implementing Realistic Asynchronous Automata. - S. Akshay 001; Ionut Dinca; Blaise Genest; Alin Stefanescu (FSTTCS, 2013)

Asynchronous Games over Tree Architectures. - Blaise Genest; Hugo Gimbert; Anca Muscholl; Igor Walukiewicz (ICALP (2), 2013)

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. - Nathalie Bertrand 001; Thomas Brihaye; Blaise Genest (QEST, 2014)

Privacy preserving minimal observability for composite transactional services. - Debmalya Biswas; Blaise Genest (Discret. Event Dyn. Syst., 2014)

Diagnosis from scenarios. - Loïc Hélouët; Hervé Marchand; Blaise Genest; Thomas Gazagnaire (Discret. Event Dyn. Syst., 2014)

Knowledge = Observation + Memory + Computation. - Blaise Genest; Doron A. Peled; Sven Schewe (FoSSaCS, 2015)

Approximate Verification of the Symbolic Dynamics of Markov Chains. - Manindra Agrawal; S. Akshay 001; Blaise Genest; P. S. Thiagarajan (J. ACM, 2015)

Taming Concurrency using Representatives. - Blaise Genest (2016)

Decidable Classes of Unbounded Petri Nets with Time and Urgency. - S. Akshay 001; Blaise Genest; Loïc Hélouët (Petri Nets, 2016)

A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways. - Sucheendra K. Palaniappan; Matthieu Pichené; Grégory Batt; Eric Fabre; Blaise Genest (HSB, 2016)

On Regularity of Unary Probabilistic Automata. - S. Akshay 001; Blaise Genest; Bruno Karelovic; Nikhil Vyas 001 (STACS, 2016)

Diagnosability degree of stochastic discrete event systems. - Hugo Bazille; Eric Fabre; Blaise Genest (CDC, 2017)

Controlling a Population. - Nathalie Bertrand 001; Miheer Dewaskar; Blaise Genest; Hugo Gimbert (CONCUR, 2017)

Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway. - Sucheendra K. Palaniappan; François Bertaux; Matthieu Pichené; Eric Fabre; Grégory Batt; Blaise Genest (Bioinform., 2017)

Qualitative Determinacy and Decidability of Stochastic Games with Signals. - Nathalie Bertrand 001; Blaise Genest; Hugo Gimbert (J. ACM, 2017)

Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. - Hugo Bazille; Eric Fabre; Blaise Genest (FoSSaCS, 2018)

Distribution-based objectives for Markov Decision Processes. - S. Akshay 001; Blaise Genest; Nikhil Vyas 001 (LICS, 2018)

Classification Among Hidden Markov Models. - S. Akshay 001; Hugo Bazille; Eric Fabre; Blaise Genest (FSTTCS, 2019)

Controlling a population. - Nathalie Bertrand 001; Miheer Dewaskar; Blaise Genest; Hugo Gimbert; Adwait Amit Godbole (Log. Methods Comput. Sci., 2019)

Global PAC Bounds for Learning Discrete Time Markov Chains. - Hugo Bazille; Blaise Genest; Cyrille Jégourel; Jun Sun 001 (CAV (2), 2020)

Timed Negotiations. - S. Akshay 001; Blaise Genest; Loïc Hélouët; Sharvik Mital (FoSSaCS, 2020)

Succinct Population Protocols for Presburger Arithmetic. - Michael Blondin; Javier Esparza; Blaise Genest; Martin Helfrich; Stefan Jaax (STACS, 2020)

Modeling Variability in Populations of Cells Using Approximated Multivariate Distributions. - Matthieu Pichené; Sucheendra K. Palaniappan; Eric Fabre; Blaise Genest (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

Resilience of Timed Systems. - S. Akshay 001; Blaise Genest; Loïc Hélouët; S. Krishna 004; Sparsa Roychowdhury (FSTTCS, 2021)

On Robustness for the Skolem and Positivity Problems. - S. Akshay 001; Hugo Bazille; Blaise Genest; Mihir Vahanwala (STACS, 2022)

Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. - Léo Henry; Blaise Genest; Alexandre Drewery (FSTTCS, 2023)

Function+Data Flow: A Framework to Specify Machine Learning Pipelines for Digital Twinning. - Eduardo de Conto; Blaise Genest; Arvind Easwaran (AIware, 2024)

Vanilla Gradient Descent for Oblique Decision Trees. - Subrat Prasad Panda; Blaise Genest; Arvind Easwaran; Ponnuthurai Nagaratnam Suganthan (ECAI, 2024)

Uncertainty-Guided Appearance-Motion Association Network for Out-of-Distribution Action Detection. - Xiang Fang; Arvind Easwaran; Blaise Genest (MIPR, 2024)

Methods for Mitigating Uncertainty in Real-Time Operations of a Connected Microgrid. - Subrat Prasad Panda; Blaise Genest; Arvind Easwaran; Rémy Rigo-Mariani; PengFeng Lin (CoRR, 2024)

Adaptive Hierarchical Graph Cut for Multi-granularity Out-of-distribution Detection. - Xiang Fang; Arvind Easwaran; Blaise Genest; Ponnuthurai Nagaratnam Suganthan (CoRR, 2024)

On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. - S. Akshay 001; Hugo Bazille; Blaise Genest; Mihir Vahanwala (Log. Methods Comput. Sci., 2024)

Your data is not perfect: Towards cross-domain out-of-distribution detection in class-imbalanced data. - Xiang Fang; Arvind Easwaran; Blaise Genest; Ponnuthurai Nagaratnam Suganthan (Expert Syst. Appl., 2025)

Adaptive Multi-prompt Contrastive Network for Few-shot Out-of-distribution Detection. - Xiang Fang; Arvind Easwaran; Blaise Genest (CoRR, 2025)

Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification. - Yuke Liao; Blaise Genest; Kuldeep Meel; Shaan Aryaman (CoRR, 2025)