5 citations · 10 across the 4 of their papers we have counts for
5 papers
Beyond Decisiveness of Infinite Markov Chains
Benoît Barbot, Patricia Bouyer, Serge Haddad
Verification of infinite-state Markov chains is still a challenge despite several fruitful numerical or statistical approaches. For decisive Markov chains, there is a simple numeri…
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…
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise
Igor Khmelnitsky, Serge Haddad, Lina Ye +5
Angluin's L* algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approxim…
Property-Directed Verification of Recurrent Neural Networks
Igor Khmelnitsky, Daniel Neider, Rajarshi Roy +6
This paper presents a property-directed approach to verifying recurrent neural networks (RNNs). To this end, we learn a deterministic finite automaton as a surrogate model from a g…
Performance modelling of access control mechanisms for local and vehicular wireless networks
Paolo Ballarini, Benoit Barbot, Nicolas Vasselin
Carrier sense multiple access collision avoidance (CSMA/CA) is the basic scheme upon which access to the shared medium is regulated in many wireless networks. With CSMA/CA a statio…