Searcharxiv⌕ Search

arXiv · 2610.02184

Sufficient Reasons and Explanations for Reactive Systems

Abstract

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 are well-known explainability measures in the context of neural networks. In this work, we unify these notions for reactive systems and formal specifications given in temporal logic, providing dedicated definitions for sufficient reasons and contrastive explanations. We then lift these definitions to \emph{temporal} sufficient reasons and contrastive explanations, providing more general and symbolic representations of explainability. We analyze the complexity of both verifying and finding explanations of the different types, and we demonstrate our approach using a prototype implementation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hadar Frenkel, Nadav Rutman Moshe. 2026-10-01. Sufficient Reasons and Explanations for Reactive Systems. https://arxiv.org/abs/2610.02184

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On the probability of being synchronizable

We prove that a random binary automaton with $n$ states is synchronizing with high probability and the asymptotic is exactly $1-Θ(\frac{1}{n})$ as conjectured in [Cameron, 2011]. We also present a deterministic algorithm which decides whether a given random automaton is synchronizing in expected time linear in $n$ and prove that it is optimal. This is an expanded and heavily revised version of the conference paper [Berlinkov, 2016] with an addition of the algorithmic result described above.

cs.FL↗

Run supports and initial algebra supports of weighted automata

We consider weighted automata over words and over trees where the weight algebras are strong bimonoids, i.e., semirings which may lack distributivity. It is well known that, for each such weighted automaton, its run semantics and its initial algebra semantics can be different, due to the absence of distributivity. Here we investigate the question under which conditions on a zero-sum-free strong bimonoid the support of the run semantics equals the support of the initial algebra semantics. We prove a characterization of this equality both for weighted automata over words and for weighted automata over trees in terms of two weakened distributivity laws for the strong bimonoids which are required to hold only for expressions evaluating to zero. This provides a natural extension of two classical results on the coincidence of the run semantics and the initial algebra semantics. We also consider shortly the images of the two semantics functions.

cs.FL↗

Undecidability of Adjacent Equality for Insertion, Shuffle, and Crossover Language Operations

We study a family of language operations based on insertion, shuffle, and crossover and investigate the undecidability of adjacent equality together with finite convergence and associated spectrum questions. Insertion and shuffle operations on formal languages arise in formal language theory, models of concurrency, and biologically inspired computation. This paper studies a different question from the usual closure problem, specifically whether an increasing sequence of languages generated by repeated insertion, or by increasing the permitted degree of bounded shuffle, reaches an instance of adjacent equality after finitely many stages. We show that several such adjacent equality questions are undecidable. In particular, reaching such an adjacent equality event is undecidable for each of the following: iterated insertion of a regular language into a context-free language; bounded shuffle of a regular language with a context-free language as the bound increases; and the corresponding self-insertion and self-bounded-shuffle hierarchies for context-free languages. The new reductions proceed directly from the undecidability of context-free-language universality, using separator-delimited block constructions and, for self-operations, an absorbing regular language of guard violations. Earlier trace-based proofs relied on mortality and uniform halting. More generally, we investigate finite-stage equality and stabilization (persistent equality) in hierarchies generated by insertion and bounded shuffle. In addition to giving substantially simpler proofs of earlier undecidability results, we obtain general criteria for one-step equality, develop new reductions for self-insertion, and identify several open problems, including structural questions concerning insertion depth and degree whose resolution determines whether adjacent equality necessarily implies permanent stabilization.

cs.FL↗