35 citations · 70 across the 9 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.FL2023★ 1 cited
Introducing Divergence for Infinite Probabilistic Models
Alain Finkel, Serge Haddad, Lina Ye
Computing the reachability probability in infinite state probabilistic models has been the topic of numerous works. Here we introduce a new property called \emph{divergence} that w…
cs.FL2023★ 1 cited
Analyzing Robustness of Angluin's L Algorithm in Presence of Noise
Lina Ye, Igor Khmelnitsky, Serge Haddad +5
Angluin's L algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively…
cs.FL2023
About Decisiveness of Dynamic Probabilistic Models
Alain Finkel, Serge Haddad, Lina Ye
Decisiveness of infinite Markov chains with respect to some (finite or infinite) target set of states is a key property that allows to compute the reachability probability of this…