List of papers of Blaise Genest by year (This is NOT DBLP)

On going work   ranking  
PDF Liao Yuke, Blaise Genest, Kuldeep S. Meel, Shaan Aryaman. I compensate, therefore I am (accurate for DNN Verification).
PDF Hugo Bazille , Eric Fabre, Kritin Garg, Blaise Genest. Opacity Degree in Interval Labelled Markov Chains.
2025   ranking  
J20 PDF Xiang Fang, Arvind Easwaran, Blaise Genest, P.N. Suganthan. Your Data Is Not Perfect: Towards Cross-Domain Out-of-Distribution Detection in Class-Imbalanced Data. Accepted in ESWA, Elsevier. To appear. IF=7.5  
2024   ranking  
C50 PDF Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, P.N. Suganthan. Vanilla Gradient Descent for Oblique Decision Trees. In ECAI'24, 1140-1147, IOS Press (open access). A  
C49 PDF Eduardo Fernandes do Conto, Blaise Genest, Arvind Easwaran. Function+Data Flow: A Framework to Specify Machine Learning Pipelines for Digital Twinning. In AIware'24, 19-27, ACM.
C48 PDF Xiang Fang, Arvind Easwaran, Blaise Genest. Uncertainty-Guided Appearance-Motion Association Network for Out-of-Distribution Action Detection (best student paper). In IEEE MIPR'24, 176-182, IEEE.
J19 PDF Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, Remy Rigo-Mariani, Pengfeng Lin. Methods for mitigating uncertainty in real-time operations of a connected microgrid. In SEGAN (Sustainable Energy, Grids and Networks), Volume 38, 101334, Elsevier. Q1,H=47
J18 PDF S. Akshay, Hugo Bazille , Blaise Genest, Mihir Vahanwala. On Robustness for the Skolem, positivity and ultimate positivity problems. In LMCS Volume 20, Issue 2. A  
2023   ranking  
C47 PDF Leo Henry, Blaise Genest, Alexandre Drewery. Reinforcement Planning for effective epsilon-optimal policies in dense time with discontinuities. Accepted at FSTTCS 2023. A  
2022   ranking  
C46 PDF S. Akshay, Hugo Bazille , Blaise Genest, Mihir Vahanwala. On Robustness for the Skolem and positivity problems. STACS 2022, 5:1-5:20, LIPIcs 219. A   0.96
2021   ranking  
C45 PDF S. Akshay, Blaise Genest, Loic Helouet, Krishna S., Sparsa Roychowdhury. Resilience of Timed Systems. FSTTCS 2021, 33:1-33:22, LIPIcs 213. A  
2020   ranking  
C44 PDF Hugo Bazille , Blaise Genest, Cyrille Jegourel, Sun Jun. Global PAC Bounds for Learning Discrete Time Markov Chains. CAV 2020, 304-326, LNCS 12225. A*   0.96
C43 PDF S. Akshay, Blaise Genest, Loic Helouet, Sharvik Mital. Timed Negotiation. FoSSaCS 2020, 37-56, LNCS 12077. A   0.88
C42 PDF Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax. Succinct Population Protocols for Presburger Arithmetic. STACS 2020, LIPIcs, 40:1-40:15. A   0.96
J17 PDF Matthieu Pichene, Sucheendra Palaniappan, Eric Fabre, Blaise Genest. Modeling Variability in Populations of Cells using Approximated Multivariate Distributions. In TCBB 17(5): 1691-1702, IEEE/ACM. C  
2019   ranking  
F1 PDF Hugo Bazille , Eric Fabre, Blaise Genest. Certification formelle des reseaux neuronaux profonds : un etat de l'art en 2019. AI&Defense 2019.
C41 PDF S. Akshay, Hugo Bazille , Eric Fabre, Blaise Genest. Classification Among Hidden Markov Models. FSTTCS 2019, 29:1-29:14, LIPIcs. A  
J16 PDF Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Godbole. Controlling a Population. In LMCS Volume 15, Issue 3, paper 5647. A  
2018   ranking  
C40 PDF S. Akshay, Blaise Genest, Nikhil Vyas. Distribution-based objectives for Markov Decision Processes. LICS 2018, 36-45, ACM/IEEE. A+   0.98
C39 PDF Hugo Bazille , Eric Fabre Blaise Genest. Complexity reduction techniques for quantified diagnosability of stochastic systems. WODES 2018, 94-99, IFAC.
C38 PDF Hugo Bazille , Eric Fabre Blaise Genest. Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings. FoSSaCS 2018, 403-419, LNCS 10803. A   0.88
2017   ranking  
P3 PDF Matthieu Pichene, Sucheendra Palaniappan, Eric Fabre, Blaise Genest. Non-Disjoint Clustered Representation for Distributions over a Population of Cells. Poster at CMSB 2017, p 324-326, LNBI 10545.
C37 PDF Hugo Bazille , Eric Fabre, Blaise Genest. Diagnosability Degree of Stochastic Discrete Event Systems. CDC 2017, 5726-5731, IEEE, 2017. A  
C36 PDF Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert. Controlling a Population. CONCUR 2017, 12:1-16, LiPIcs. A   0.96
J15 PDF Nathalie Bertrand, Blaise Genest, Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. (46 pages). In JACM:64(5), 33:1-33:48. A+   Prem
J14 PDF Sucheendra Palaniappan, Francois Bertaux, Matthieu Pichene, Eric Fabre, Gregory Batt, Blaise Genest. Discrete Stochastic Abstraction of Biological Pathway Dynamics: A case study of the Apoptosis Pathway. In Bioinformatics 33 (13): 1980e1986, Oxford University Press.   Lead
2016   ranking  
En Blaise Genest. Taming Concurrency using Representatives. (Habilitation Thesis). Rennes 1.
P2 PDF Matthieu Pichene, Sucheendra Palaniappan, Gregory Batt, Eric Fabre, Blaise Genest. Efficient Analysis of Multi-level Biological Systems Using Abstraction. Poster at HSB 2016.
C35 PDF Sucheendra Palaniappan, Matthieu Pichene, Gregory Batt, Eric Fabre, Blaise Genest. A Look-ahead Simulation Algorithm for DBN Models of Biochemical Pathways. HSB 2016 (42% accepting rate), 3-19, LNBI 9957.
C34 PDF S. Akshay, Blaise Genest, Loic Helouet. Decidable classes of unbounded Petri nets with time and urgency. ICATPN 2016(31% accepting rate), 301-322, LNCS 9698. B   0.54
C33 PDF S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas. On Regularity of unary Probabilistic Automata. STACS 2016 (26% accepting rate), LIPIcs, 8:1-8:14. A   0.96
2015   ranking  
P1 PDF Sucheendra Palaniappan, Franeois Bertaux, Matthieu Pichene, Eric Fabre, Gregory Batt, Blaise Genest. Approximating the dynamics of the Hybrid Stochastic-Deterministic Apoptosis pathway. Poster at CMSB 2015.
C32 PDF Blaise Genest, Doron Peled, Sven Schewe. Knowledge = observation + memory + computation. FoSSaCS 2015 (30% accepting rate), 215-229, LNCS 9034. A   0.88
J13 PDF Manindra Agrawal, S. Akshay, Blaise Genest, P.S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. JACM 62(1): 34-65. A+   Prem
2014   ranking  
C31 PDF Nathalie Bertrand, Thomas Brihaye, Blaise Genest. Deciding the value 1 problem in 1-clock Decision Stochastic Timed Automata. QEST 2014 (39% acceptance rate), LNCS 8657, 313-328.
J12 PDF Debmalya Biswas, Blaise Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services. JDEDS 24(4): 611-646.
J11 PDF Loic Helouet, Herve Marchand, Blaise Genest, Thomas Gazagnaire. Diagnosis from Scenarios. JDEDS, 24(4): 353-415.
2013   ranking  
C30 PDF S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu. Implementing Realistic Asynchronous Automata. FSTTCS 2013 (36% acceptance rate), 213-224, LIPIcs. A  
C29 PDF Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. ICALP 2013 (29% acceptance rate), LNCS 7966, 275-286. A  0.95
2012   ranking  
C28 PDF Manindra Agrawal, S. Akshay, Blaise Genest, P.S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS 2012 (long paper, 35% acceptance rate), 55-64, IEEE 978-0-7695-4769-5. A+   0.98
C27 PDF S. Akshay, Blaise Genest, Loic Helouet, Shaofa Yang. Symbolically Bounding the Drift in Time-Constrained MSC Graphs. ICTAC 2012 (22% acceptance rate), 1-15, LNCS 7521. B  
J10 PDF S. Akshay, Blaise Genest, Loic Helouet, Shaofa Yang. Regular Set of Representatives for Time-Constrained MSC Graphs. IPL 112(14-15):592-598, Elsevier. B   Lead
J9 PDF Sucheendra Palaniappan, S. Akshay, Liu Bing , Blaise Genest, P.S. Thiagarajan. A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application (special issue of CMSB'11, 10% acceptance rate for the special issue). TCBB 9(5):1352-1365 (2012), IEEE/ACM.
2011   ranking  
C26 PDF Nathalie Bertrand, Blaise Genest. Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS 2011 (32% acceptance rate), 411-422, LIPIcs. A  
C25 PDF Sucheendra Palaniappan, S. Akshay, Blaise Genest, P.S. Thiagarajan. A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks. CMSB 2011 (40% acceptance rate), 35-44, ACM 978-1-4503-0817-5.
2010   ranking  
C24 PDF Blaise Genest, Anca Muscholl, Zhilin Wu. Verifying Recursive Active Documents with Positive Data Tree Rewriting. FSTTCS 2010 (29% acceptance rate), 469-480, LIPIcs. A  
C23 PDF Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP 2010 (28% acceptance rate), 52-63, LNCS 6199. A  0.95
J8 PDF Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang. Quasi-Static Scheduling of Communicating Tasks (Special issue of CONCUR 2008, 5% acceptance rate for the special issue). IC 208(10):1154e1168, Elsevier. A   Prem
J7 PDF Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Special issue of ATVA 2007, 6% acceptance rate for the special issue). IJFCS 21(2): 211-233, WorldSciNet. B   Rep
2009   ranking  
C22 PDF Nathalie Bertrand, Blaise Genest, Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009 (30% acceptance rate), 319-328, IEEE 978-0-7695-3746-7 . A+   0.98
C21 PDF Debmalya Biswas, Ashwin Jiwane , Blaise Genest. Atomicity for XML Databases. XSym 2009 , 160-167 (short paper), LNCS 5679. C
J6 PDF Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled. On Commutativity Based Edge Lean Search. (Special issue of BISFAI 2007). Annals Math & AI 56(2): 187-210. Springer. A   Lead
J5 PDF Thomas Gazagnaire, Blaise Genest, Loic Helouet, P.S. Thiagarajan, Shaofa Yang. Causal Message Sequence Charts. TCS 410(41): 4094-4110, Elsevier. A   Lead
2008   ranking  
C20 PDF Debmalya Biswas, Thomas Gazagnaire, Blaise Genest. Small Logs for Transactional Services. HASE 2008 (22% acceptance rate), 97-106, IEEE 978-0-7695-3482-4. B
C19 PDF Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun. Tree Pattern Rewrite Systems. ATVA 2008 (32% acceptance rate), 332-346, LNCS 5311. A
C18 PDF Philippe Darondeau, Blaise Genest, P.S. Thiagarajan, Shaofa Yang : Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008 (27% acceptance rate), 310-324, LNCS 5201. A   0.96
C17 PDF Debmalya Biswas, Blaise Genest. Minimal Observability for Transactional Hierarchical Services. SEKE 2008, 531-536, Knowledge Systems Institute Graduate School. ISBN 1-891706-22-5. B   0.88
C16 PDF Philippe Darondeau, Blaise Genest, Loic Helouet. Products of Message Sequence Charts. FoSSaCS 2008, 459-474, LNCS 4962. A   0.88
J4 PS Blaise Genest, Anca Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. TOCS 42(4): 536-567, Springer. B
2007   ranking  
PDF Debmalya Biswas, Blaise Genest. Decomposing Minimal Observability for Transactional Services (Internal report).
C15 PDF Edith Elkind, Blaise Genest, Doron Peled, Paola Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007, 378-393, LNCS 4762. A
C14 PDF Thomas Gazagnaire, Blaise Genest, Loic Helouet, P.S. Thiagarajan, Shaofa Yang. Causal Message Sequence Charts. CONCUR 2007, 166-180, LNCS 4703. A   0.96
C13 PS Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron Peled. On Commutativity Based Edge Lean Search. ICALP 2007, 158-170, LNCS 4596. A   0.95
C12 PDF Edith Elkind, Blaise Genest, Doron Peled. Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007, 420-434, LNCS 4424. A   0.92
J3 PDF Blaise Genest, Dietrich Kuske, Anca Muscholl. On Communicating Automata with Bounded Channels. FI 80(2): 147-167 , IOS Press. B
2006   ranking  
C11 PS Loic Helouet, Thomas Gazagnaire, Blaise Genest. Diagnosis from Scenarios. WODES 2006, 307-312, IEEE 1-4244-0053-8.
C10 PS Edith Elkind, Blaise Genest, Doron Peled, Hongyang Qu. Grey-Box Checking. FORTE 2006, 420-435, LNCS 4229. A
C9 PS Blaise Genest, Anca Muscholl. Constructing Exponential-size Deterministic Zielonka Automata. ICALP 2006, 565-576, LNCS 4052. A   0.95
J2 PS Blaise Genest, Dietrich Kuske, Anca Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. IC 204(6): 920-956. A   Prem
J1 PS Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. JCSS 72(4): 617-647. A+ Prem
2005   ranking  
C8 PS Blaise Genest. On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. CONCUR 2005, 443-457, LNCS 3653. A   0.96
C7 PS Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron Peled. Snapshot Verification. TACAS 2005, 510-525, LNCS 3440. A   0.92
C6 PS Blaise Genest. Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs. TACAS 2005, 429-444, LNCS 3440. A   0.92
2004   ranking  
Fr En Blaise Genest. The odyssey of MSC-graphs (PhD Thesis). Paris 7.
PS Blaise Genest. Compositionality Everywhere: The end of MSC-Graphs? (Internal report).
C5 PS Blaise Genest, Dietrich Kuske, Anca Muscholl. A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. DLT 2004, 30-48, LNCS 3340. B
C4 PS Blaise Genest, Marius Minea, Anca Muscholl, Doron Peled. Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004, 195-210, LNCS 2987. A   0.88
2003   ranking  
PS Blaise Genest, Anca Muscholl. The Structure of Local-Choice in High-Level Message Sequence Charts (Internal report).
C3 PS Blaise Genest, Loic Helouet, Anca Muscholl. High-Level Message Sequence Charts and Projections. CONCUR 2003, 308-322, LNCS 2761. A   0.96
OC1 PS Blaise Genest, Anca Muscholl, Doron Peled. Message Sequence Charts. Concurrency and Petri Nets 2003, 537-558, LNCS 3098.
2002   ranking  
C2 PS Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002, 657-668, LNCS 2380. A   0.95
C1 PS Blaise Genest, Anca Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. LATIN 2002, 326-340, LNCS 2286. B   0.53
2001
PS Blaise Genest. Extension of Process Rewrite Systems (Internal report at LSV, ENS Cachan).
Fr Blaise Genest. Verification des Graphes de diagrammes de Sequences Hierarchiques (Master Thesis).

Thanks to the DBLP Page