Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Barbot, Benoît"'
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 numerical algorithm that frames the reachability probability as accurately a
Externí odkaz:
http://arxiv.org/abs/2409.18670
We consider the synthesis problem on timed automata with B\"uchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller needs to avoid punctual guards, such as testing the equality of a cloc
Externí odkaz:
http://arxiv.org/abs/2404.18584
Autor:
Ye, Lina, Khmelnitsky, Igor, Haddad, Serge, Barbot, Benoît, Bollig, Benedikt, Leucker, Martin, Neider, Daniel, Roy, Rajarshi
Publikováno v:
Logical Methods in Computer Science, Volume 20, Issue 1 (March 20, 2024) lmcs:11472
Angluin's L$^*$ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous ran
Externí odkaz:
http://arxiv.org/abs/2306.08266
Autor:
Khmelnitsky, Igor, Haddad, Serge, Ye, Lina, Barbot, Benoît, Bollig, Benedikt, Leucker, Martin, Neider, Daniel, Roy, Rajarshi
Publikováno v:
EPTCS 370, 2022, pp. 81-96
Angluin's L* algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by a la
Externí odkaz:
http://arxiv.org/abs/2209.10315
Publikováno v:
In Computers in Biology and Medicine December 2024 183
Autor:
Khmelnitsky, Igor, Neider, Daniel, Roy, Rajarshi, Barbot, Benoît, Bollig, Benedikt, Finkel, Alain, Haddad, Serge, Leucker, Martin, Ye, Lina
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 given RNN using active automata learning. This model may then be analyz
Externí odkaz:
http://arxiv.org/abs/2009.10610
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 station willing to start a transmission has first to find the channel free f
Externí odkaz:
http://arxiv.org/abs/1901.04285
Publikováno v:
In Performance Evaluation August 2015 90:53-77
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Khmelnitsky, Igor, Neider, Daniel, Roy, Rajarshi, Xie, Xuan, Barbot, Benoît, Bollig, Benedikt, Finkel, Alain, Haddad, Serge, Leucker, Martin, Ye, Lina
Publikováno v:
International Journal on Software Tools for Technology Transfer; Jun2023, Vol. 25 Issue 3, p341-354, 14p