Blaise Genest

Orcid: 0000-0002-5758-1876

According to our database1, Blaise Genest authored at least 63 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems.
Log. Methods Comput. Sci., 2024

Methods for Mitigating Uncertainty in Real-Time Operations of a Connected Microgrid.
CoRR, 2024

Uncertainty-Guided Appearance-Motion Association Network for Out-of-Distribution Action Detection.
Proceedings of the 7th IEEE International Conference on Multimedia Information Processing and Retrieval, 2024

Vanilla Gradient Descent for Oblique Decision Trees.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Function+Data Flow: A Framework to Specify Machine Learning Pipelines for Digital Twinning.
Proceedings of the 1st ACM International Conference on AI-Powered Software, 2024

2023
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
On Robustness for the Skolem and Positivity Problems.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
Resilience of Timed Systems.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020
Modeling Variability in Populations of Cells Using Approximated Multivariate Distributions.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Succinct Population Protocols for Presburger Arithmetic.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Timed Negotiations.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

Global PAC Bounds for Learning Discrete Time Markov Chains.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Controlling a population.
Log. Methods Comput. Sci., 2019

Classification Among Hidden Markov Models.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Distribution-based objectives for Markov Decision Processes.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Qualitative Determinacy and Decidability of Stochastic Games with Signals.
J. ACM, 2017

Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway.
Bioinform., 2017

Controlling a Population.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Diagnosability degree of stochastic discrete event systems.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017

2016
On Regularity of Unary Probabilistic Automata.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways.
Proceedings of the Hybrid Systems Biology - 5th International Workshop, 2016

Decidable Classes of Unbounded Petri Nets with Time and Urgency.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

Taming Concurrency using Representatives.
, 2016

2015
Approximate Verification of the Symbolic Dynamics of Markov Chains.
J. ACM, 2015

Knowledge = Observation + Memory + Computation.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
Diagnosis from scenarios.
Discret. Event Dyn. Syst., 2014

Privacy preserving minimal observability for composite transactional services.
Discret. Event Dyn. Syst., 2014

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

2013
Asynchronous Games over Tree Architectures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Implementing Realistic Asynchronous Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Regular set of representatives for time-constrained MSC graphs.
Inf. Process. Lett., 2012

Symbolically Bounding the Drift in Time-Constrained MSC Graphs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

2011
Minimal Disclosure in Partially Observable Markov Decision Processes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways.
Proceedings of the Computational Methods in Systems Biology, 9th International Conference, 2011

2010
Quantifying the Discord: Order Discrepancies in Message Sequence Charts.
Int. J. Found. Comput. Sci., 2010

Quasi-static scheduling of communicating tasks.
Inf. Comput., 2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Verifying Recursive Active Documents with Positive Data Tree Rewriting.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Causal Message Sequence Charts.
Theor. Comput. Sci., 2009

On commutativity based Edge Lean search.
Ann. Math. Artif. Intell., 2009

Atomicity for XML Databases.
Proceedings of the Database and XML Technologies, 6th International XML Database Symposium, 2009

2008
Pattern Matching and Membership for Hierarchical Message Sequence Charts.
Theory Comput. Syst., 2008

Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
CoRR, 2008

Minimal Observability for Transactional Hierarchical Services.
Proceedings of the Twentieth International Conference on Software Engineering & Knowledge Engineering (SEKE'2008), 2008

Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination.
Proceedings of the 11th IEEE High Assurance Systems Engineering Symposium, 2008

Products of Message Sequence Charts.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Tree Pattern Rewriting Systems.
Proceedings of the Automated Technology for Verification and Analysis, 2008

2007
On Communicating Automata with Bounded Channels.
Fundam. Informaticae, 2007

Detecting Races in Ensembles of Message Sequence Charts.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

2006
Infinite-state high-level MSCs: Model-checking and realizability.
J. Comput. Syst. Sci., 2006

A Kleene theorem and model checking algorithms for existentially bounded communicating automata.
Inf. Comput., 2006

Constructing Exponential-Size Deterministic Zielonka Automata.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Grey-Box Checking.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

2005
Snapshot Verification.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

On Implementation of Global Concurrent Systems with Local Asynchronous Controllers.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Message Sequence Charts: A Survey.
Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004
Specifying and Verifying Partial Order Properties Using Template MSCs.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms.
Proceedings of the Developments in Language Theory, 2004

2003
High-Level Message Sequence Charts and Projections.
Proceedings of the CONCUR 2003, 2003

Message Sequence Charts.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003


  Loading...