Blaise Genest

From MaRDI portal
Person:436615

Available identifiers

zbMath Open genest.blaiseMaRDI QIDQ436615

List of research outcomes





PublicationDate of PublicationType
On robustness for the Skolem, positivity and ultimate positivity problems2024-06-27Paper
On robustness for the Skolem and positivity problems2024-04-23Paper
Resilience of Timed Systems2024-02-05Paper
Succinct Population Protocols for Presburger Arithmetic2023-02-07Paper
Classification among Hidden Markov Models2023-02-03Paper
Global PAC bounds for learning discrete time Markov chains2021-02-09Paper
Distribution-based objectives for Markov Decision Processes2021-01-20Paper
Timed negotiations2020-09-23Paper
https://portal.mardi4nfdi.de/entity/Q51116242020-05-27Paper
A Look-Ahead Simulation Algorithm for DBN Models of Biochemical Pathways2019-12-04Paper
https://portal.mardi4nfdi.de/entity/Q52275182019-08-06Paper
Symbolically quantifying response time in stochastic models using moments and semirings2018-07-17Paper
Qualitative Determinacy and Decidability of Stochastic Games with Signals2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46018572018-01-24Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains2017-05-16Paper
https://portal.mardi4nfdi.de/entity/Q29639152017-02-21Paper
Decidable Classes of Unbounded Petri Nets with Time and Urgency2016-10-04Paper
Knowledge = Observation + Memory + Computation2015-10-01Paper
Approximate Verification of the Symbolic Dynamics of Markov Chains2015-08-14Paper
Diagnosis from scenarios2014-12-12Paper
Privacy preserving minimal observability for composite transactional services2014-12-12Paper
Asynchronous Games over Tree Architectures2013-08-07Paper
Symbolically Bounding the Drift in Time-Constrained MSC Graphs2012-09-21Paper
Minimal disclosure in partially observable Markov decision processes2012-08-31Paper
Verifying recursive active documents with positive data tree rewriting2012-08-29Paper
Regular set of representatives for time-constrained MSC graphs2012-07-25Paper
Quasi-static scheduling of communicating tasks2010-10-07Paper
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata2010-09-07Paper
QUANTIFYING THE DISCORD: ORDER DISCREPANCIES IN MESSAGE SEQUENCE CHARTS2010-04-22Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
On commutativity based edge lean search2010-03-15Paper
Causal message sequence charts2009-09-29Paper
Grey-Box Checking2009-03-11Paper
Quasi-Static Scheduling of Communicating Tasks2008-11-25Paper
Tree Pattern Rewriting Systems2008-11-20Paper
Causal Message Sequence Charts2008-09-18Paper
Quantifying the Discord: Order Discrepancies in Message Sequence Charts2008-07-03Paper
https://portal.mardi4nfdi.de/entity/Q35043432008-06-11Paper
Pattern matching and membership for hierarchical message sequence charts2008-06-06Paper
Products of Message Sequence Charts2008-04-11Paper
https://portal.mardi4nfdi.de/entity/Q54319172008-01-02Paper
On Commutativity Based Edge Lean Search2007-11-28Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
Constructing Exponential-Size Deterministic Zielonka Automata2007-09-11Paper
Detecting Races in Ensembles of Message Sequence Charts2007-09-03Paper
CONCUR 2005 – Concurrency Theory2006-11-01Paper
A Kleene theorem and model checking algorithms for existentially bounded communicating automata2006-07-12Paper
Infinite-state high-level MSCs: model-checking and realizability2006-06-30Paper
Lectures on Concurrency and Petri Nets2005-12-23Paper
Developments in Language Theory2005-12-22Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
https://portal.mardi4nfdi.de/entity/Q30443372004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47371972004-08-11Paper

Research outcomes over time

This page was built for person: Blaise Genest