default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBlaise Genest
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. Log. Methods Comput. Sci. 20(2) (2024)- [c50]Eduardo de Conto
, Blaise Genest, Arvind Easwaran:
Function+Data Flow: A Framework to Specify Machine Learning Pipelines for Digital Twinning. AIware 2024 - [c49]Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, Ponnuthurai Nagaratnam Suganthan:
Vanilla Gradient Descent for Oblique Decision Trees. ECAI 2024: 1140-1147 - [c48]Xiang Fang, Arvind Easwaran, Blaise Genest:
Uncertainty-Guided Appearance-Motion Association Network for Out-of-Distribution Action Detection. MIPR 2024: 176-182 - [i12]Eduardo de Conto, Blaise Genest, Arvind Easwaran:
Function+Data Flow: A Framework to Specify Machine Learning Pipelines for Digital Twinning. CoRR abs/2406.19670 (2024) - [i11]Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, Ponnuthurai Nagaratnam Suganthan:
Vanilla Gradient Descent for Oblique Decision Trees. CoRR abs/2408.09135 (2024) - [i10]Xiang Fang, Arvind Easwaran, Blaise Genest:
Uncertainty-Guided Appearance-Motion Association Network for Out-of-Distribution Action Detection. CoRR abs/2409.09953 (2024) - [i9]Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, Rémy Rigo-Mariani, PengFeng Lin:
Methods for Mitigating Uncertainty in Real-Time Operations of a Connected Microgrid. CoRR abs/2409.19568 (2024) - 2023
- [c47]Léo Henry, Blaise Genest, Alexandre Drewery:
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. FSTTCS 2023: 13:1-13:18 - 2022
- [c46]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem and Positivity Problems. STACS 2022: 5:1-5:20 - [i8]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. CoRR abs/2211.02365 (2022) - 2021
- [c45]S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, Sparsa Roychowdhury:
Resilience of Timed Systems. FSTTCS 2021: 33:1-33:22 - 2020
- [j17]Matthieu Pichené, Sucheendra K. Palaniappan, Eric Fabre, Blaise Genest:
Modeling Variability in Populations of Cells Using Approximated Multivariate Distributions. IEEE ACM Trans. Comput. Biol. Bioinform. 17(5): 1691-1702 (2020) - [c44]Hugo Bazille, Blaise Genest, Cyrille Jégourel, Jun Sun:
Global PAC Bounds for Learning Discrete Time Markov Chains. CAV (2) 2020: 304-326 - [c43]S. Akshay, Blaise Genest, Loïc Hélouët, Sharvik Mital:
Timed Negotiations. FoSSaCS 2020: 37-56 - [c42]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. STACS 2020: 40:1-40:15
2010 – 2019
- 2019
- [j16]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole:
Controlling a population. Log. Methods Comput. Sci. 15(3) (2019) - [c41]S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest:
Classification Among Hidden Markov Models. FSTTCS 2019: 29:1-29:14 - [i7]Michael Blondin, Javier Esparza, Blaise Genest, Martin Helfrich, Stefan Jaax:
Succinct Population Protocols for Presburger Arithmetic. CoRR abs/1910.04600 (2019) - 2018
- [c40]Hugo Bazille, Eric Fabre, Blaise Genest:
Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. FoSSaCS 2018: 403-419 - [c39]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. LICS 2018: 36-45 - [i6]S. Akshay, Blaise Genest, Nikhil Vyas:
Distribution-based objectives for Markov Decision Processes. CoRR abs/1804.09341 (2018) - [i5]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole:
Controlling a population. CoRR abs/1807.00893 (2018) - 2017
- [j15]Sucheendra K. Palaniappan, François Bertaux, Matthieu Pichené, Eric Fabre, Grégory Batt, Blaise Genest:
Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway. Bioinform. 33(13): 1980-1986 (2017) - [j14]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. J. ACM 64(5): 33:1-33:48 (2017) - [c38]Hugo Bazille, Eric Fabre, Blaise Genest:
Diagnosability degree of stochastic discrete event systems. CDC 2017: 5726-5731 - [c37]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert:
Controlling a Population. CONCUR 2017: 12:1-12:16 - [i4]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert:
Controlling a Population. CoRR abs/1707.02058 (2017) - 2016
- [b1]Blaise Genest:
Taming Concurrency using Representatives. University of Rennes 1, France, 2016 - [c36]S. Akshay, Blaise Genest, Loïc Hélouët:
Decidable Classes of Unbounded Petri Nets with Time and Urgency. Petri Nets 2016: 301-322 - [c35]Sucheendra K. Palaniappan, Matthieu Pichené, Grégory Batt, Eric Fabre, Blaise Genest:
A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways. HSB 2016: 3-19 - [c34]S. Akshay, Blaise Genest, Bruno Karelovic, Nikhil Vyas:
On Regularity of Unary Probabilistic Automata. STACS 2016: 8:1-8:14 - 2015
- [j13]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62(1): 2:1-2:34 (2015) - [c33]Blaise Genest, Doron A. Peled, Sven Schewe:
Knowledge = Observation + Memory + Computation. FoSSaCS 2015: 215-229 - 2014
- [j12]Loïc Hélouët, Hervé Marchand, Blaise Genest, Thomas Gazagnaire:
Diagnosis from scenarios. Discret. Event Dyn. Syst. 24(4): 353-415 (2014) - [j11]Debmalya Biswas, Blaise Genest:
Privacy preserving minimal observability for composite transactional services. Discret. Event Dyn. Syst. 24(4): 611-646 (2014) - [c32]Nathalie Bertrand, Thomas Brihaye, Blaise Genest:
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. QEST 2014: 313-328 - 2013
- [c31]S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu:
Implementing Realistic Asynchronous Automata. FSTTCS 2013: 213-224 - [c30]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. ICALP (2) 2013: 275-286 - 2012
- [j10]S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Regular set of representatives for time-constrained MSC graphs. Inf. Process. Lett. 112(14-15): 592-598 (2012) - [j9]Sucheendra K. Palaniappan, S. Akshay, Bing Liu, Blaise Genest, P. S. Thiagarajan:
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1352-1365 (2012) - [c29]S. Akshay, Blaise Genest, Loïc Hélouët, Shaofa Yang:
Symbolically Bounding the Drift in Time-Constrained MSC Graphs. ICTAC 2012: 1-15 - [c28]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS 2012: 55-64 - [i3]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012) - 2011
- [c27]Sucheendra K. Palaniappan, S. Akshay, Blaise Genest, P. S. Thiagarajan:
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways. CMSB 2011: 35-44 - [c26]Nathalie Bertrand, Blaise Genest:
Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS 2011: 411-422 - 2010
- [j8]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
Quasi-static scheduling of communicating tasks. Inf. Comput. 208(10): 1154-1168 (2010) - [j7]Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. Int. J. Found. Comput. Sci. 21(2): 211-233 (2010) - [c25]Blaise Genest, Anca Muscholl, Zhilin Wu:
Verifying Recursive Active Documents with Positive Data Tree Rewriting. FSTTCS 2010: 469-480 - [c24]Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz:
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63 - [i2]Blaise Genest, Anca Muscholl, Zhilin Wu:
Verifying Recursive Active Documents with Positive Data Tree Rewriting. CoRR abs/1003.1010 (2010)
2000 – 2009
- 2009
- [j6]Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled:
On commutativity based Edge Lean search. Ann. Math. Artif. Intell. 56(2): 187-210 (2009) - [j5]Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
Causal Message Sequence Charts. Theor. Comput. Sci. 410(41): 4094-4110 (2009) - [c23]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009: 319-328 - [c22]Debmalya Biswas, Ashwin Jiwane, Blaise Genest:
Atomicity for XML Databases. XSym 2009: 180-187 - 2008
- [j4]Blaise Genest, Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts. Theory Comput. Syst. 42(4): 536-567 (2008) - [c21]Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun:
Tree Pattern Rewriting Systems. ATVA 2008: 332-346 - [c20]Philippe Darondeau, Blaise Genest, P. S. Thiagarajan, Shaofa Yang:
Quasi-Static Scheduling of Communicating Tasks. CONCUR 2008: 310-324 - [c19]Philippe Darondeau, Blaise Genest, Loïc Hélouët:
Products of Message Sequence Charts. FoSSaCS 2008: 458-473 - [c18]Debmalya Biswas, Thomas Gazagnaire, Blaise Genest:
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination. HASE 2008: 97-106 - [c17]Debmalya Biswas, Blaise Genest:
Minimal Observability for Transactional Hierarchical Services. SEKE 2008: 531-536 - [i1]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides. CoRR abs/0811.3975 (2008) - 2007
- [j3]Blaise Genest, Dietrich Kuske, Anca Muscholl:
On Communicating Automata with Bounded Channels. Fundam. Informaticae 80(1-3): 147-167 (2007) - [c16]Edith Elkind, Blaise Genest, Doron A. Peled, Paola Spoletini:
Quantifying the Discord: Order Discrepancies in Message Sequence Charts. ATVA 2007: 378-393 - [c15]Thomas Gazagnaire, Blaise Genest, Loïc Hélouët, P. S. Thiagarajan, Shaofa Yang:
Causal Message Sequence Charts. CONCUR 2007: 166-180 - [c14]Dragan Bosnacki, Edith Elkind, Blaise Genest, Doron A. Peled:
On Commutativity Based Edge Lean Search. ICALP 2007: 158-170 - [c13]Edith Elkind, Blaise Genest, Doron A. Peled:
Detecting Races in Ensembles of Message Sequence Charts. TACAS 2007: 420-434 - 2006
- [j2]Blaise Genest, Dietrich Kuske, Anca Muscholl:
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204(6): 920-956 (2006) - [j1]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-state high-level MSCs: Model-checking and realizability. J. Comput. Syst. Sci. 72(4): 617-647 (2006) - [c12]Edith Elkind, Blaise Genest, Doron A. Peled, Hongyang Qu:
Grey-Box Checking. FORTE 2006: 420-435 - [c11]Blaise Genest, Anca Muscholl:
Constructing Exponential-Size Deterministic Zielonka Automata. ICALP (2) 2006: 565-576 - 2005
- [c10]Blaise Genest, Anca Muscholl:
Message Sequence Charts: A Survey. ACSD 2005: 2-4 - [c9]Blaise Genest:
On Implementation of Global Concurrent Systems with Local Asynchronous Controllers. CONCUR 2005: 443-457 - [c8]Blaise Genest:
Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs. TACAS 2005: 429-444 - [c7]Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled:
Snapshot Verification. TACAS 2005: 510-525 - 2004
- [c6]Blaise Genest, Anca Muscholl, Dietrich Kuske:
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. Developments in Language Theory 2004: 30-48 - [c5]Blaise Genest, Marius Minea, Anca Muscholl, Doron A. Peled:
Specifying and Verifying Partial Order Properties Using Template MSCs. FoSSaCS 2004: 195-210 - 2003
- [c4]Blaise Genest, Anca Muscholl, Doron A. Peled:
Message Sequence Charts. Lectures on Concurrency and Petri Nets 2003: 537-558 - [c3]Blaise Genest, Loïc Hélouët, Anca Muscholl:
High-Level Message Sequence Charts and Projections. CONCUR 2003: 308-322 - 2002
- [c2]Blaise Genest, Anca Muscholl, Helmut Seidl, Marc Zeitoun:
Infinite-State High-Level MSCs: Model-Checking and Realizability. ICALP 2002: 657-668 - [c1]Blaise Genest, Anca Muscholl:
Pattern Matching and Membership for Hierarchical Message Sequence Charts. LATIN 2002: 326-340
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
