Related papers: Structural Invariants for Parametric Verification …

The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…

Among the various critical systems that worth to be formally analyzed, a wide set consists of controllers for dynamical systems. Those programs typically execute an infinite loop in which simple com putations update internal states and…

While reachability analysis is one of the most promising approaches for formal verification of dynamic systems, a major disadvantage preventing a more widespread application is the requirement to manually tune algorithm parameters such as…

Software verification has emerged as a key concern for ensuring the continued progress of information technology. Full verification generally requires, as a crucial step, equipping each loop with a "loop invariant". Beyond their role in…

We study the long-time behavior of two run-and-tumble particles on the real line subjected to an attractive interaction potential and jamming interactions, which prevent the particles from crossing. We provide the explicit invariant…

We address a fundamental issue in the nonparametric inference for systems of interacting particles: the identifiability of the interaction functions. We prove that the interaction functions are identifiable for a class of first-order…

Integrable models form pillars of theoretical physics because they allow for full analytical understanding. Despite being rare, many realistic systems can be described by models that are close to integrable. Therefore, an important question…

We present assume-guarantee contracts for continuous-time linear dynamical systems with inputs and outputs. These contracts are used to express specifications on the dynamic behaviour of a system. Contrary to existing approaches, we use…

This work establishes fundamental principles for verifying contract for interconnected hybrid systems. When system's hybrid arcs conform to the contract for a certain duration but subsequently violate it, the composition of hybrid dynamical…

Causality plays a central role in understanding interactions between variables in complex systems. These systems often exhibit state-dependent causal relationships, where both the strength and direction of causality vary with the value of…

Interrupts have been widely used in safety-critical computer systems to handle outside stimuli and interact with the hardware, but reasoning about interrupt-driven software remains a difficult task. Although a number of static verification…

Interfaces play a central role in determining compatible component compositions by prescribing permissible interactions between a service provider (server) and its consumers (clients). The high degree of concurrency in asynchronous…

In this paper, we consider to what degree the structure of a linear system is determined by the system's input/output behavior. The structure of a linear system is a directed graph where the vertices represent the variables in the system…

A hallmark of living systems is the ability to employ a common set of versatile building blocks that can self-organize into a multitude of different structures, in a way that can be controlled with minimal cost. This capability can only be…

In this paper, we investigate signatures of topological phase transitions in interacting systems. We show that the key signature is the existence of a topologically protected level crossing, which is robust and sharply defines the…

Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger…

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

We consider a solution of automata similar to Population Protocols and Network Constructors. The automata (or nodes) move passively in a well-mixed solution and can cooperate by interacting in pairs. Every such interaction may result in an…

This paper outlines a general formal framework for reasoning systems, intended to support future analysis of inference architectures across domains. We model reasoning systems as structured tuples comprising phenomena, explanation space,…

We prove the almost sure invariance principle for stationary R^d--valued processes (with dimension-independent very precise error terms), solely under a strong assumption on the characteristic functions of these processes. This assumption…