14 citations · 19 across the 11 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2026
Sufficient Reasons and Explanations for Reactive Systems
Hadar Frenkel, Nadav Rutman Moshe
We address the problem of temporal causality and explainability for reactive systems, and, in this setting, study sufficient reasons and contrastive explanations. These two notions…
cs.FL2022★ 1 cited
Realizable and Context-Free Hyperlanguages
Hadar Frenkel, Sarai Sheinvald
Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of…
cs.FL2020
On the Complexity of Symbolic Finite-State Automata
Dana Fisman, Hadar Frenkel, Sandra Zilles
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the numbe…