O-Minimal Invariants for Discrete-Time Dynamical Systems

Termination analysis of linear loops plays a key rôle in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination relates to deep open problems in number theory, such as the decidability of the Skolem and Positivity Problems for linear recurrence sequences, or equivalently reachability questions for discrete-time linear dynamical systems. In this article, we introduce the class of o-minimal invariants , which is broader than any previously considered, and study the decidability of the existence and algorithmic synthesis of such invariants as certificates of non-termination for linear loops equipped with a large class of halting conditions. We establish two main decidability results, one of them conditional on Schanuel’s conjecture is transcendental number theory.

Finite-Time Set Reachability of Probabilistic Boolean Multiplex Control Networks

This study focuses on the finite-time set reachability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, based on the state transfer graph (STG) reconstruction technique, the PBMCNs are extended to random logic dynamical systems. Then, a necessary and sufficient condition for the finite-time set reachability of PBMCNs is obtained. Finally, the obtained results are effectively illustrated by an example.

What’s decidable about linear loops?

We consider the MSO model-checking problem for simple linear loops, or equivalently discrete-time linear dynamical systems, with semialgebraic predicates (i.e., Boolean combinations of polynomial inequalities on the variables). We place no restrictions on the number of program variables, or equivalently the ambient dimension. We establish decidability of the model-checking problem provided that each semialgebraic predicate either has intrinsic dimension at most 1, or is contained within some three-dimensional subspace. We also note that lifting either of these restrictions and retaining decidability would necessarily require major breakthroughs in number theory.

A Critical Evaluation of Dynamical Systems Models of Bipolar Disorder

Bipolar disorder (BD) is a mood disorder involving recurring (hypo)manic and depressive episodes. The inherently temporal nature of BD has inspired its conceptualization using dynamical systems theory, which is a mathematical framework for understanding systems that evolve over time. In this paper we provide a critical review of dynamical systems models of BD. Owing to heterogeneity of methodologies and experimental designs in computational modeling, we designed a structured approach to guide our review in a fashion that parallels the appraisal of animal models by their Face, Predictive, and Construct Validity. This tool, the Validity Appraisal Guide for Computational Models (VAG-CM) is not an absolute estimate of validity, but rather a guide for more objective appraisal of models in this review. We identified 26 studies published before November 18, 2021 that proposed generative dynamical systems models of time-varying signals in BD. Two raters independently applied the VAG-CM to included studies, obtaining a mean Cohen's kappa of 0.55 (95% CI [0.45, 0.64]) prior to establishing consensus ratings. Consensus VAG-CM ratings revealed three model/study clusters: data-driven models with face validity, theory-driven models with predictive validity, and theory-driven models lacking all forms of validity. We conclude that future models should be developed using a hybrid approach that first operationalizes BD features of interest using empirical data (a data-driven approach), followed by explanations of those features using generative models with components that are homologous to physiological or psychological systems involved in BD (a theory-driven approach).