Temporal Causality in Reactive Systems

Coenen, Norine; Finkbeiner, Bernd; Frenkel, Hadar; Hahn, Christopher; Niklas, Metzger,; Siber, Julian

doi:10.1007/978-3-031-19992-9_13

Cited by 9 publications

(18 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…HyperLTL [14] is the most studied logic for expressing hyperproperties. A range of problems from different areas in computer science can be expressed as Hyper-LTL MC problems, including (optimal) path panning [38], mutation testing [26], linearizability [30], robustness [21], information-flow control [35], and causality checking [17], to name only a few. Consequently, any model checking tool for HyperLTL is applicable to many disciples within computer science and provides a unified solution to many challenging algorithmic problems.…”

Section: Related Work and Hyperltl Verification Approachesmentioning

confidence: 99%

“…Hyperproperties [15] are system properties that relate multiple executions of a system. Such properties are of increasing importance as they naturally occur, e.g., in information-flow control [35], robustness [21], linearizability [29,30], path planning [38], mutation testing [26], and causality checking [17]. A prominent logic to express hyperproperties is HyperLTL, which extends linear-time temporal logic (LTL) with explicit trace quantification [14].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

AutoHyper: Explicit-State Model Checking for HyperLTL

Beutner¹,

Finkbeiner²

2023

Preprint

View full text Add to dashboard Cite

HyperLTL is a temporal logic that can express hyperproperties, i.e., properties that relate multiple execution traces of a system. Such properties are becoming increasingly important and naturally occur, e.g., in information-flow control, robustness, mutation testing, path planning, and causality checking. Thus far, complete model checking tools for HyperLTL have been limited to alternation-free formulas, i.e., formulas that use only universal or only existential trace quantification. Properties involving quantifier alternations could only be handled in an incomplete way, i.e., the verification might fail even though the property holds. In this paper, we present AutoHyper, an explicit-state automatabased model checker that supports full HyperLTL and is complete for properties with arbitrary quantifier alternations. We show that language inclusion checks can be integrated into HyperLTL verification, which allows AutoHyper to benefit from a range of existing inclusion-checking tools. We evaluate AutoHyper on a broad set of benchmarks drawn from different areas in the literature and compare it with existing (incomplete) methods for HyperLTL verification.

show abstract

Section: Related Work and Hyperltl Verification Approachesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

AutoHyper: Explicit-State Model Checking for HyperLTL

Beutner¹,

Finkbeiner²

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…For instance, consider that changing atomic proposition u at position 0 has the same quantitative distance as changing it at position 1, but since the identity of these changes differs, the direction in the space of worlds is different. Many instances of counterfactual reasoning, therefore, base their notion of distance on subset relationships between changes, i.e., some world is further away than another if the changes necessary to obtain the former are a superset of the changes necessary to obtain the latter [26,25,16]. Then, if no subset relationship in either directions holds between the changes manifesting in two worlds, their distance is incomparable.…”

Section: The Distance Between Worldsmentioning

confidence: 99%

“…When reasoning about causation, we are most often interested in some notion of minimality to characterize the minimal changes necessary to avoid a given effect [26,25,30,15,16]. From a counterfactual point of view, minimality formulates an additional condition on the antecedent ϕ such that the property defines the largest set possible.…”

Section: Minimal Counterfactualsmentioning

confidence: 99%

“…We argue that for both operators, the naive extensions to non-total similarity relations do not match the intended semantics of the counterfactual statements they are supposed to formalize, and propose fixed semantics for non-total similarity relations. Another common requirement for causes is a notion of minimality [26,25,30,16,15], such that negating the cause describes the minimal changes necessary to avoid the effect. This notion is not covered by Lewis' original theory.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Counterfactuals Modulo Temporal Logics

Finkbeiner¹,

Siber²

EPiC Series in Computing

Self Cite

View full text Add to dashboard Cite

Lewis’ theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences, such as counterexamples found by a model checker and trajectories produced by a reinforcement learning agent. In particular, our extension considers a more relaxed notion of similarity between worlds and proposes two additional counterfactual operators that close a semantic gap between the previous two in this more general setting. Further, we consider versions of counterfactuals that minimize the distance to the witnessing counterfactual worlds, a common requirement in causal analysis. To automate counterfactual reasoning in the temporal domain, we introduce a logic that combines temporal and counterfactual operators, and outline decision procedures for the satisfiability and trace-checking problems of this logic.

show abstract

AutoHyper: Explicit-State Model Checking for HyperLTL

Beutner

Finkbeiner

2023

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

HyperLTL is a temporal logic that can express hyperproperties, i.e., properties that relate multiple execution traces of a system. Such properties are becoming increasingly important and naturally occur, e.g., in information-flow control, robustness, mutation testing, path planning, and causality checking. Thus far, complete model checking tools for HyperLTL have been limited to alternation-free formulas, i.e., formulas that use only universal or only existential trace quantification. Properties involving quantifier alternations could only be handled in an incomplete way, i.e., the verification might fail even though the property holds. In this paper, we present , an explicit-state automata-based model checker that supports full HyperLTL and is complete for properties with arbitrary quantifier alternations. We show that language inclusion checks can be integrated into HyperLTL verification, which allows to benefit from a range of existing inclusion-checking tools. We evaluate on a broad set of benchmarks drawn from different areas in the literature and compare it with existing (incomplete) methods for HyperLTL verification.

show abstract

Temporal Causality in Reactive Systems

Cited by 9 publications

References 21 publications

AutoHyper: Explicit-State Model Checking for HyperLTL

AutoHyper: Explicit-State Model Checking for HyperLTL

Counterfactuals Modulo Temporal Logics

AutoHyper: Explicit-State Model Checking for HyperLTL

Contact Info

Product

Resources

About