Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise

Autor: Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

Publikováno v: Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)

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: https://doaj.org/article/8dd86d71259747fa8d865384a168fb80

Minimal Coverability Tree Construction Made Complete and Efficient

Autor: Serge Haddad, Igor Khmelnitsky, Alain Finkel

Publikováno v: Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science ISBN: 9783030452308
FoSSaCS
FoSSaCS 2020-23rd International Conference on Foundations of Software Science and Computation Structures
FoSSaCS 2020-23rd International Conference on Foundations of Software Science and Computation Structures, Apr 2020, Dublin, Ireland

Downward closures of Petri net reachability sets can be finitely represented by their set of maximal elements called the minimal coverability set or Clover. Many properties (coverability, boundedness, ...) can be decided using Clover, in a time propo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb2532e2dd219d9fbd9d1d2cdb828fd6
http://europepmc.org/articles/PMC7788628

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise

Autor: Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy

Publikováno v: GandALF 2022-13th International Symposium on Games, Automata, Logics and Formal Verification
GandALF 2022-13th International Symposium on Games, Automata, Logics and Formal Verification, Sep 2022, Madrid, Spain. pp.81-96, ⟨10.4204/EPTCS.370.6⟩
Electronic Proceedings in Theoretical Computer Science
Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification

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: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a76d6763e21219fdb367fee8c88d14f

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks

Autor: Lina Ye, Benoît Barbot, Igor Khmelnitsky, Alain Finkel, Benedikt Bollig, Serge Haddad, Rajarshi Roy, Martin Leucker, Xuan Xie, Daniel Neider

Publikováno v: Automated Technology for Verification and Analysis ISBN: 9783030888848
ATVA

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: https://explore.openaire.eu/search/publication?articleId=doi_________::d0365ec06e8f0da8d5bffbd75b5b952b
https://doi.org/10.1007/978-3-030-88885-5_24

CONNECTION BETWEEN THE LEVEL OF ANESTHESIA AND HEMODYNAMIC AND HEART RATE VARIABILITY

Autor: Svetlana Gorbacheva, Vladimir Gorbachev, Igor Khmelnitsky, Светлана Михайловна Горбачева (Ru)

Publikováno v: Acta Biomedica Scientifica, Vol 2, Iss 3, Pp 9-13 (2017)

The work presents the analysis of changes of statistical parameters, hemodynamic and cardiac rhythm variability in dynamics depending on sedation level according to the bispectral index in patients undergone intravenous anaesthesia in painful endosco

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f92d27772f81fd6280a4413d25e94b9
https://doi.org/10.12737/article_59f035f79bf049.81385637