Blaise Genest - Citegraph

Author Info

Name	Affiliation	Papers
BLAISE GENEST	LIAFA, Université Paris VII & CNRS, 2, pl. Jussieu, case 7014, 75251 Paris cedex 05, France	49
Collaborators	Citations	PageRank
48	304	25.09
Referers	Referees	References
363	658	699

Search Limit

100658

Publications (49 rows)

Collaborators (48 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Timed Negotiations.	0	0.34	2020
Modeling Variability in Populations of Cells Using Approximated Multivariate Distributions	0	0.34	2020
Succinct Population Protocols for Presburger Arithmetic.	0	0.34	2020
Classification Among Hidden Markov Models.	0	0.34	2019
Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings.	0	0.34	2018
Distribution-based objectives for Markov Decision Processes.	0	0.34	2018
Abstracting the dynamics of biological pathways using information theory: a case study of apoptosis pathway.	2	0.39	2017
CONTROLLING A POPULATION	0	0.34	2017
Diagnosability Degree Of Stochastic Discrete Event Systems	0	0.34	2017
Regularity of Unary Probabilistic Automata	2	0.38	2016
Decidable Classes of Unbounded Petri Nets with Time and Urgency.	3	0.39	2016
Knowledge = Observation + Memory + Computation.	1	0.37	2015
Diagnosis from scenarios	2	0.37	2014
Deciding The Value 1 Problem For Reachability In 1-Clock Decision Stochastic Timed Automata	1	0.38	2014
Privacy preserving minimal observability for composite transactional services	1	0.40	2014
Asynchronous games over tree architectures	11	0.58	2013
Implementing Realistic Asynchronous Automata.	3	0.38	2013
Regular set of representatives for time-constrained MSC graphs	2	0.38	2012
A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application	1	0.36	2012
Approximate Verification of the Symbolic Dynamics of Markov Chains	8	0.56	2012
Symbolically bounding the drift in time-constrained MSC graphs	2	0.37	2012
Minimal Disclosure in Partially Observable Markov Decision Processes.	0	0.34	2011
A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways	4	0.44	2011
Optimal Zielonka-type construction of deterministic asynchronous automata	13	0.60	2010
Verifying Recursive Active Documents with Positive Data Tree Rewriting	4	0.41	2010
Quasi-static scheduling of communicating tasks	7	0.49	2010
Quantifying the Discord: Order Discrepancies in Message Sequence Charts	2	0.38	2010
Causal Message Sequence Charts	8	0.53	2009
On commutativity based Edge Lean search	3	0.41	2009
Qualitative Determinacy and Decidability of Stochastic Games with Signals	23	1.05	2009
Atomicity for XML Databases	1	0.36	2009
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides	0	0.34	2008
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination	6	0.50	2008
Minimal Observability for Transactional Hierarchical Services	6	0.55	2008
Products of Message Sequence Charts	3	0.44	2008
Pattern Matching and Membership for Hierarchical Message Sequence Charts.	0	0.34	2008
Tree Pattern Rewriting Systems	11	0.69	2008
Detecting races in ensembles of message sequence charts	3	0.39	2007
On Communicating Automata with Bounded Channels	9	0.56	2007
Constructing exponential-size deterministic zielonka automata	11	0.59	2006
A Kleene theorem and model checking algorithms for existentially bounded communicating automata	40	1.38	2006
Compositional message sequence charts (CMSCs) are better to implement than MSCs	5	0.49	2005
On implementation of global concurrent systems with local asynchronous controllers	4	0.41	2005
Message Sequence Charts: A Survey	4	0.42	2005
A kleene theorem for a class of communicating automata with effective algorithms	16	0.85	2004
Specifying and Verifying Partial Order Properties Using Template MSCs	12	0.65	2004
Message Sequence Charts	19	1.04	2003
Pattern Matching and Membership for Hierarchical Message Sequence Charts	13	0.75	2002
Infinite-State High-Level MSCs: Model-Checking and Realizability	38	1.72	2002