English
Related papers

Related papers: Integrability ex machina

200 papers

Formal verification has been successfully developed in computer science for verifying combinatorial classes of models and specifications. In like manner, formal verification methods have been developed for dynamical systems. However, the…

Systems and Control · Computer Science 2013-08-27 Rafael Wisniewski

In this article we address the problem of automatic answer checking in interactive learning systems that support mathematical notation. This problem consists of the problem of establishing identities in formal mathematical systems and hence…

Other Computer Science · Computer Science 2016-02-02 Vladimir G. Danilov , Ilya S. Turuntaev

Knowledge about existence, strength, and dominant direction of causal influences is of paramount importance for understanding complex systems. With limited amounts of realistic data, however, current methods for investigating causal links…

Data Analysis, Statistics and Probability · Physics 2020-10-20 Erik Laminski , Klaus R. Pawelzik

Metamorphic testing is a testing method for problems without test oracles. Integration testing allows for detecting errors in complex systems that may not be found during the testing of their components. In this paper, we propose a novel…

Software Engineering · Computer Science 2023-05-02 Sofia F. Yakusheva , Anton S. Khritankov

We consider integrable boundary conditions for both discrete and continuum classical integrable models. Local integrals of motion generated by the corresponding transfer matrices give rise to time evolution equations for the initial Lax…

High Energy Physics - Theory · Physics 2009-06-19 Jean Avan , Anastasia Doikou

An analysis of the dynamics is performed, of exactly solvable models for fragile and strong glasses, exploiting the partitioning of the free energy landscape in inherent structures. The results are compared with the exact solution of the…

Statistical Mechanics · Physics 2009-11-07 Luca Leuzzi , Theo M. Nieuwenhuizen

In this paper we solve the problem of finding a trajectory that shows that a given hybrid dynamical system with deterministic evolution leaves a given set of states considered to be safe. The algorithm combines local with global search for…

Systems and Control · Computer Science 2014-06-25 Jan Kuřátko , Stefan Ratschan

Estimating causal interactions in complex dynamical systems is an important problem encountered in many fields of current science. While a theoretical solution for detecting the causal interactions has been previously formulated in the…

Data Analysis, Statistics and Probability · Physics 2020-01-20 Jakub Kořenek , Jaroslav Hlinka

In recent years, significant advances have been made in the design and analysis of fully dynamic maximal matching algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the…

Data Structures and Algorithms · Computer Science 2020-04-21 Monika Henzinger , Shahbaz Khan , Richard Paul , Christian Schulz

Developing and fielding complex systems requires proof that they are reliably correct with respect to their design and operating requirements. Especially for autonomous systems which exhibit unanticipated emergent behavior, fully…

Software Engineering · Computer Science 2024-02-28 Matthew Litton , Doron Drusinsky , James Bret Michael

Complex systems often exhibit unexpected faults that are difficult to handle. Such systems are desirable to be diagnosable, i.e. faults can be automatically detected as they occur (or shortly afterwards), enabling the system to handle the…

Software Engineering · Computer Science 2015-02-27 Hernán Ponce de León , Gonzalo Bonigo , Laura Brandán Briones

Compositional verification algorithms are well-studied in the context of model checking. Properly selecting components for verification is important for efficiency, yet has received comparatively less attention. In this paper, we address…

Formal Languages and Automata Theory · Computer Science 2024-08-19 Ian Dardik , April Porter , Eunsuk Kang

Reliability analysis of mechatronic systems is a recent field and a dynamic branch of research. It is addressed whenever there is a need for reliable, available, and safe systems. The studies of reliability must be conducted earlier during…

Other Computer Science · Computer Science 2016-06-21 N. Bensaid Amrani , L. Saintis , D. Sarsri , M. Barreau

Symmetry properties are at the basis of integrability. In recent years, it appeared that so called "twisted symmetries" are as effective as standard symmetries in many respects (integrating ODEs, finding special solutions to PDEs). Here we…

Mathematical Physics · Physics 2010-02-09 G. Cicogna , G. Gaeta

Reconfiguration aims at recovering a system from a fault by automatically adapting the system configuration, such that the system goal can be reached again. Classical approaches typically use a set of pre-defined faults for which…

Artificial Intelligence · Computer Science 2021-05-19 Kaja Balzereit , Oliver Niggemann

In [1], we have presented the theoretical background for finding the Elementary Invariants for a 3D system of first order rational differential equations (1ODEs). We have also provided an algorithm to find such Invariants. Here we introduce…

Mathematical Physics · Physics 2017-08-30 L. G. S. Duarte , J. P. C. Eiras , L. A. C. P. da Mota

The world is structured in countless ways. It may be prudent to enforce corresponding structural properties to a learning algorithm's solution, such as incorporating prior beliefs, natural constraints, or causal structures. Doing so may…

Machine Learning · Computer Science 2021-11-30 Francesco Locatello

Integrability conditions for Lie systems are related to reduction or transformation processes. We here analyse a geometric method to construct integrability conditions for Riccati equations following these approaches. This approach provides…

Mathematical Physics · Physics 2011-04-07 José F. Cariñena , Javier de Lucas

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact…

Machine Learning · Computer Science 2012-07-02 Avi Pfeffer

A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…

Dynamical Systems · Mathematics 2021-07-21 Ashish Tiwari