Zobrazeno 1 - 10
of 262
pro vyhledávání: '"Leucker, Martin"'
A question we can ask of multi-agent systems is whether the agents' collective interaction satisfies particular goals or specifications, which can be either individual or collective. When a collaborative goal is not reached, or a specification is vio
Externí odkaz:
http://arxiv.org/abs/2309.14048
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
Runtime Verification deals with the question of whether a run of a system adheres to its specification. This paper studies runtime verification in the presence of partial knowledge about the observed run, particularly where input values may not be pr
Externí odkaz:
http://arxiv.org/abs/2207.05678
Autor:
Petersen, Eike, Potdevin, Yannik, Mohammadi, Esfandiar, Zidowitz, Stephan, Breyer, Sabrina, Nowotka, Dirk, Henn, Sandra, Pechmann, Ludwig, Leucker, Martin, Rostalski, Philipp, Herzog, Christian
Publikováno v:
IEEE Access, Vol. 10, pp. 58375-58418, 2022
Machine learning is expected to fuel significant improvements in medical care. To ensure that fundamental principles such as beneficence, respect for human autonomy, prevention of harm, justice, privacy, and transparency are respected, medical machin
Externí odkaz:
http://arxiv.org/abs/2107.09546
We correct our proof of a theorem stating that satisfiability of frequency linear-time temporal logic is undecidable [TASE 2012].
Externí odkaz:
http://arxiv.org/abs/2010.00296
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