Publications of Blaise Genest

Load the BibTeX file

Academic Journals

  1. Matthieu Pichené, Sucheendra K. Palaniappan, Eric Fabre, Blaise Genest. Modeling Variability in Populations of Cells using Approximated Multivariate Distributions. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17(5):1691-1702, 2020. details doi pdf
  2. N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert, A. Godbole. Controlling a population. Logical Methods in Computer Science, 15(3):1-30, 2019. details doi pdf
  3. S. Palaniappan, F. Bertaux, M. Pichené, E. Fabre, G. Batt, B. Genest. Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway. Bioinformatics, 33(13):1980-1986, February 2017. details doi
  4. M. Agrawal, S. Akshay, B. Genest, P.S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM (JACM), 62(1):34-65, 2015. details download
  5. D. Biswas, B. Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services. Discrete Event Dynamic Systems, 24(4):611-646, 2014. details doi
  6. L. Hélouet, H. Marchand, B. Genest, T. Gazagnaire. Diagnosis from Scenarios, and applications. Discrete Event Dynamic Systems : Theory and Applications, (To appear), 2013. details doi pdf
  7. D. Biswas, B. Genest. Minimal Observability and Privacy Preserving Compensation for Transactional Services.. Discrete Event Dynamic Systems, December 2013. details pdf
  8. S. Akshay, B. Genest, L. Hélouet, S. Yang. Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett, 112(14):592-598, 2012. details
  9. S. Palaniappan, S. Akshay, B. Liu, B. Genest, P. S. Thiagarajan. A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE/ACM Trans. Comput. Biology Bioinform, 9(5):1352-1365, 2012. details
  10. P. Darondeau, B. Genest, P.S. Thiagarajan, S. Yang. Quasi-static scheduling of communicating tasks. Information and Computation, Special Issue: 19th International Conference on Concurrency Theory (CONCUR 2008), 208(10):1154-1168, 2010. details download download
  11. E. Elkind, B. Genest, D. Peled, P. Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts (Special Issue of ATVA'07). International Journal of Foundations of Computer Sciecnce (IJFCS), 21(2):211-233, 2010. details
  12. D. Bosnacki, E. Elkind, B. Genest, D. Peled. On Commutativity Based Edge Lean Search. Special issue of BISFAI 2007, Annals of Mathematic and Artificial Intelligence (AMAI), in press(0), 2009. details
  13. T. Gazagnaire, B. Genest, L. Hélouet, P.S. Thiagarajan, Shaofa Yang. Causal Message Sequence Charts. Theoretical Computer Science (TCS), 410(41):4094-4110, 2009. details
  14. B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. Theory of Computing Systems (TOCS), 42(4):536-567, 2008. details
  15. B. Genest, D. Kuske, A. Muscholl. On Communicating Automata with Bounded Channels. Fundamenta Informaticae, IOS Press, 80:1-21, 2007. details
  16. B. Genest, D. Kuske, A. Muscholl. A Kleene Theorem and Model Checking for a Class of Communicating Automata. Information and Computation, 204(6):920-956, 2006. details
  17. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. J. Computer and System Science JCSS, 72(4):617-647, 2006. details

International Conferences

  1. S Akshay, H. Bazille, B. Genest, M. Vahanwala. On Robustness for the Skolem and Positivity Problems. In STACS 2022 - 39th International Symposium on Theoretical Aspects of Computer Science, Volume 219, Pages 1-20, Marseille, France, May 2022. details doi pdf
  2. S. Akshay, B. Genest, L. Hélouet, S. Krishna, S. Roychowdhury. Resilience of Timed Systems. In FSTTCS 2021 - 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pages 1-22, Virtual Conference due to COVID, India, December 2021. details doi pdf
  3. Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax. Succinct Population Protocols for Presburger Arithmetic. In STACS 2020, STACS 2020, Volume LIPICS, Pages 40-40, Montpellier, France, 2020. details doi pdf
  4. Hugo Bazille, Blaise Genest, Cyrille Jegourel, Jun Sun. Global PAC Bounds for Learning Discrete Time Markov Chains. In CAV 2020, CAV 2020, Volume LNCS, Pages 304-326, Los Angeles, United States, 2020. details pdf
  5. S Akshay, B. Genest, L. Hélouet, S. Mital. Timed Negotiations. In 23rd International Conference on Foundations of Software Science and Computation Structures, Dublin (physical conference cancelled), Ireland, April 2020. details pdf
  6. S Akshay, H. Bazille, E. Fabre, B. Genest. Classification among Hidden Markov Models. In FSTTCS 2019 - 39th IARCS Annual Conference on. Foundations of Software Technology and Theoretical Computer Science, Volume 150 of LIPIcs, Pages 1-14, Bombay, India, December 2019. details doi pdf
  7. H. Bazille, E. Fabre, B. Genest. Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings. In FOSSACS 2018, xx, France, 2018. details
  8. H. Bazille, E. Fabre, B. Genest. Complexity reduction techniques for quantified diagnosability of stochastic systems. In WODES'18, Sorrento Coast, Italy, 2018. details
  9. S. Akshay, B. Genest, N. Vyas. Distribution-based objectives for Markov Decision Processes. In LICS 2018, the 33rd Annual ACM/IEEE Symposium, Oxford, United Kingdom, July 2018. details doi
  10. M. Pichené, S.K. Palaniappan, E. Fabre, B. Genest. Non-Disjoint Clustered Representation for Distributions over a Population of Cells (poster). In CMSB 2017, CMSB 2017 - 15th International Conference on Computational Methods in Systems Biology, Volume LNCS/LNBI, Pages 324-326, Darmstadt, Germany, 2017. details pdf
  11. H. Bazille, E. Fabre, B. Genest. Diagnosability Degree of Stochastic Discrete Event Systems. In CDC 2017 - 56th IEEE Conference on Decision and Control, Pages 1-6, Melbourne, Australia, December 2017. details pdf
  12. N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert. Controlling a Population. In CONCUR 2017 - 28th International Conference on Concurrency Theory, Pages 1-23, Berlin, Germany, September 2017. details pdf
  13. S. Akshay, B. Genest, V. Karelovic, N. Vyas. On Regularity of unary Probabilistic Automata. In STACS 2016, STACS 2016, Orléans, France, 2016. details pdf
  14. B. Genest, D. Peled, S. Schewe. Knowledge = Observation + Memory + Computation. In FoSSaCS 2015, FoSSaCS 2015, Volume LNCS, Pages 215-229, London, United Kingdom, 2015. details doi download
  15. N. Bertrand, Th. Brihaye, B. Genest. Deciding the value 1 problem for reachability in 1-clock decision stochastic timed automata. In proceedings of the 11th International Conference on Quantitative Evaluation of Systems (QEST'14), Springer (ed.), LNCS, Volume 8657, Pages 313-328, Firenze, Italy, September 2014. details doi pdf
  16. S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu. Implementing Realistic Asynchronous Automata.. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, LIPIcs, Volume 24, Pages 213-224, Guwahati, Inde, December 2013. details pdf
  17. B. Genest, H. Gimbert, A. Muscholl, I. Walukiewicz. Asynchronous Games over Tree Architectures. In 40th International Colloquium on Automata, Languages and Programming (ICALP'13), Springer (ed.), LNCS, Volume 7966, Pages 275-286, Riga, Latvia, July 2013. details doi pdf
  18. M. Agrawal, S. Akshay, B. Genest, P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. In Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Pages 55-64, 2012. details
  19. S. Akshay, B. Genest, L. Hélouet, S. Yang. Symbolically Bounding the Drift in Time-Constrained MSC Graphs. In Theoretical Aspects of Computing - ICTAC 2012 - 9th International Colloquium, Abhik Roychoudhury, Meenakshi D'Souza (eds.), Lecture Notes in Computer Science, Volume 7521, Pages 1-15, 2012. details
  20. N. Bertrand, B. Genest. Minimal Disclosure in Partially Observable Markov Decision Processes . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, Pages 411-422, Bombay, India, 2011. details doi download
  21. N. Bertrand, B. Genest, Gimbert. H.. Qualitative Determinacy and Decidability of Stochastic Games with Signals. In 24th Annual IEEE Symposium on Logic in Computer Science (LICS'09), Pages 319-328, Los Angeles, CA, USA, August 2009. details doi pdf
  22. P. Darondeau, B. Genest, P. S. S. Thiagarajan, S. Yang. Quasi-Static Scheduling of Communicating Tasks. In CONCUR 2008 - Concurrency Theory, Springer-Verlag (ed.), Lecture Notes in Computer Science, Volume 5201, Pages 310-324, Berlin/Heidelberg, 2008. details doi
  23. P. Darondeau, B. Genest, L. Hélouet. Products of Message Sequence Charts. In Foundations of Software Science and Computational Structures, Springer Berlin / Heidelberg (ed.), Lecture Notes in Computer Science, Volume 4962, Pages 458-473, 2008. details
  24. Dragan Bosnacki, Edith Elkind, B. Genest, Doron Peled. On Commutativity Based Edge Lean Search. In ICALP, Volume LNCS 4596, Pages 158-170, 2007. details
  25. E. Elkind, B. Genest, D. Peled. Detecting Races in Ensembles of Message Sequence Charts. In TACAS, Volume LNCS 4424, Pages 420-434, 2007. details
  26. E. Elkind, B. Genest, D. Peled, P. Spoletini. Quantifying the Discord: Order Discrepancies in Message Sequence Charts. In ATVA, LNCS, Pages 378-393, 2007. details
  27. T. Gazagnaire, B. Genest, L. Hélouet, P.S. and Yang, S. Thiagarajan. Causal Message Sequence Charts. In Proceedings of CONCUR 2007, 2007. details
  28. E. Elkind, B. Genest, D. Peled, H. Qu. Grey Box Checking. In FORTE, Volume LNCS 4229, Pages 420-435, 2006. details
  29. B. Genest, A. Muscholl. Constructing Exponential-size Deterministic Zielonka Automata. In ICALP, Volume LNCS 4052, Pages 565-576, 2006. details
  30. L. Hélouet, T. Gazagnaire, B. Genest. Diagnosis from Scenarios. In proc. of the 8th Int. Workshop on Discrete Events Systems, WODES'06, Pages 307-312, 2006. details
  31. B. Genest. Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs. In TACAS, Volume LNCS 3440, Pages 429-444, 2005. details
  32. B. Genest. On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. In CONCUR, Volume LNCS 3653, Pages 443-457, 2005. details
  33. B. Genest, D. Kuske, A. Muscholl, D. Peled. Snapshot Verification. In TACAS, Volume LNCS 3440, Pages 510-525, 2005. details
  34. B. Genest, A. Muscholl. Message Sequence Charts: A Survey. In ACSD, Pages 2-4, 2005. details
  35. B. Genest, A. Muscholl, D. Kuske. A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. In Developments in Language Theory, Volume LNCS 3340, Pages 30-48, 2004. details
  36. B. Genest, M. Minea, A. Muscholl, D. Peled. Specifying and Verifying Partial Order Properties Using Template MSCs. In FoSSaCS, Volume LNCS 2987, Pages 195-210, 2004. details
  37. B. Genest, A. Muscholl, D. Peled. Message Sequence Charts. In Lectures on Concurrency and Petri Nets, Volume LNCS 3098, Pages 537-558, 2003. details
  38. B. Genest, L. Hélouet, A. Muscholl. High-level Message Sequence Charts projection. In proceedings of CONCUR 2003, Marseille, September 2003. details ps
  39. B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. In LATIN, Volume LNCS 2286, Pages 326-340, 2002. details
  40. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun. Infinite-State High-Level MSCs: Model-Checking and Realizability. In ICALP, Volume LNCS 2380, Pages 657-668, 2002. details

Invited Conferences

  1. S. Palaniappan, S. Akshay, B. Genest, P.S. Thiagarajan. A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks. In 9th International Conference on Computational Methods in Systems Biology (CMSB), Volume ACM 978-1-4503-0817-5, Pages 35-44, 2011. details
  2. S. Akshay, B. Genest, L. Hélouet, S. Yang. Regular Set of Representatives for Time-Constrained MSC Graphs. November 2011. details
  3. B. Genest, H. Gimbert, A. Muscholl, I. Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. In ICALP (2), Lecture Notes in Computer Science, Volume 6199, Pages 52-63, 2010. details
  4. B. Genest, A. Muscholl, Z. Wu. Verifying Recursive Active Documents with Positive Data Tree Rewriting. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Kamal Lodaya, Meena Mahajan (eds.), Leibniz International Proceedings in Informatics (LIPIcs), Keywords: Active documents, Guarded Active XML, verification, data trees, tree rewriting, well-structured systems, Volume 8, Pages 469-480, Dagstuhl, Germany, 2010. details
  5. D. Biswas, A. Jiwane, B. Genest. Atomicity for XML Databases. In Sixth International XML Database Symposium (XSym), Volume LNCS 5679, Pages 160-167, 2009. details
  6. D. Biswas, T. Gazagnaire, B. Genest. Small Logs for Transactional Services. In 11th IEEE High Assurance Systems Engineering Symposium (HASE'08), Nanjing, China, December 2008. details
  7. B. Genest, A. Muscholl, O. Serre, M. Zeitoun. Tree Pattern Rewrite Systems. In 6th International Symposium on Automated Technology for Verification and Analysis (ATVA'08), LNCS, Volume 5311, Pages 332-346, Seoul, Korea, October 2008. details
  8. D. Biswas, B. Genest. Minimal Observability for Transactional Hierarchical Services. In 20th International Conference on Software Engineering and Knowledge Engineering (SEKE'08), Volume ISBN 1-891706-22-5, Pages 531-536, San Francisco, USA, July 2008. details

National Conferences

  1. H. Bazille, E. Fabre, B. Genest. Certification formelle des réseaux neuronaux profonds : un état de l'art en 2019. In AI and Defense 2019 - Artificial Intelligence and defense, Actes de AI&Defense, Pages 1-10, Rennes, France, November 2019. details pdf

Research Reports

  1. B. Genest, P. Darondeau, L. Hélouet. Products of Message Sequence Charts. INRIA Research report INRIA, No 6258, 2007. details
  2. T. Gazagnaire, B. Genest, L. Hélouet, P.S. and Yang, S. Thiagarajan. Causal Message Sequence Charts. INRIA Research Report INRIA, No 0, 2007. details
  3. B. Genest, A. Muscholl, O. Serre, M. Zeitoun. Well Structured Control of Data Tree and the Decidability of AXML. 2007. details
  4. P. Darondeau, B. Genest, L. Hélouet. Products of Message Sequence Charts. Research Report INRIA, No 6258, July 2007. details download
  5. P. Darondeau, B. Genest, L. Hélouet. L2.2 R : description d'un modèle de tuiles, propriétés fondamentales. Research Report Projet CO2, 2006. details

Misc

  1. S. Palaniappan, F. Bertaux, M. Pichene, E. Fabre, G. Batt, B. Genest. Approximating the dynamics of the Hybrid Stochastic-Deterministic Apoptosis pathway. CMSB 2015, 2015. details

Thesis

  1. Blaise Genest. Taming Concurrency using Representatives.. Habilitation à diriger des recherches Université de Rennes 1, March 2016. details pdf

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic