English
Related papers

Related papers: Abstraction of Elementary Hybrid Systems by Variab…

200 papers

In applied settings, tests of hypothesis where a nuisance parameter is only identifiable under the alternative often reduces into one of Testing One Hypothesis Multiple times (TOHM). Specifically, a fine discretization of the space of the…

Methodology · Statistics 2022-04-06 Sara Algeri , David A. van Dyk

Effective field theories (EFTs) are widely considered by physicists to be explanatory and to be the appropriate frameworks for modelling various phenomena at different scales. At the same time, they are known to be approximate, restricted,…

History and Philosophy of Physics · Physics 2025-07-08 Martin King

This work proposes and analyzes a compressed sensing approach to polynomial approximation of complex-valued functions in high dimensions. Of particular interest is the setting where the target function is smooth, characterized by a rapidly…

Numerical Analysis · Mathematics 2020-01-22 Abdellah Chkifa , Nick Dexter , Hoang Tran , Clayton G. Webster

Hybrid machine learning combines physical knowledge with data-driven models to enhance interpretability and performance. In this context, Port-Hamiltonian Systems (PHS), which generalize Hamiltonian mechanics to describe open,…

Machine Learning · Computer Science 2026-05-14 Maximino Linares , Guillaume Doras , Thomas Hélie

Verifying safety and liveness over array systems is a highly challenging problem. Array systems naturally capture parameterized systems such as distributed protocols with an unbounded number of processes. Such distributed protocols often…

Software Engineering · Computer Science 2024-01-08 Chih-Duo Hong , Anthony W. Lin

Safety verification of robot applications is extremely challenging due to the complexity of the environment that a robot typically operates in. Formal verification with model-checking provides guarantees but it may often take too long or…

Robotics · Computer Science 2025-05-30 Christoph Luckeneder , Ralph Hoch , Hermann Kaindl

In this paper, we present a computational approach to certify almost sure reachability for discrete-time polynomial stochastic systems by turning drift--variant criteria into sum-of-squares (SOS) programs solved with standard semidefinite…

Optimization and Control · Mathematics 2025-10-30 Arash Bahari Kordabad , Rupak Majumdar , Sadegh Soudjani

A simple method is proposed to estimate the instantaneous correlations between state variables in a hybrid system from the empirical correlations between observable market quantities such as spot rate, stock price and implied volatility.…

Computational Finance · Quantitative Finance 2023-07-10 Baron Law

In this paper we study possibilities of using hierarchical reasoning, symbol elimination and model generation for the verification of parametric systems, where the parameters can be constants or functions. Our goal is to automatically…

Logic in Computer Science · Computer Science 2019-10-14 Viorica Sofronie-Stokkermans

The similarity searches that use high-dimensional feature vectors consisting of a vast amount of data have a wide range of application. One way of conducting a fast similarity search is to transform the feature vectors into binary vectors…

Information Retrieval · Computer Science 2014-06-17 Yui Noma , Makiko Konoshima

Abstraction of a continuous-space model into a finite state and input dynamical model is a key step in formal controller synthesis tools. To date, these software tools have been limited to systems of modest size (typically $\leq$ 6…

Systems and Control · Computer Science 2018-01-29 Felix Gruber , Eric S. Kim , Murat Arcak

Modern cryptographic methods for implementing privacy-preserving LLMs such as \gls{HE} require the LLMs to have a polynomial form. Forming such a representation is challenging because transformers include non-polynomial components, such as…

Software model checkers based on under-approximations and SMT solvers are very successful at verifying safety (i.e. reachability) properties. They combine two key ideas -- (a) "concreteness": a counterexample in an under-approximation is a…

Logic in Computer Science · Computer Science 2013-06-11 Anvesh Komuravelli , Arie Gurfinkel , Sagar Chaki , Edmund M. Clarke

We propose a new framework for the analysis of current and future cosmological surveys, which combines perturbative methods (PT) on large scales with conditional simulation-based implicit inference (SBI) on small scales. This enables…

Cosmology and Nongalactic Astrophysics · Physics 2023-09-20 Chirag Modi , Oliver H. E. Philcox

Cyber-Physical Systems (CPS) pose new challenges to verification and validation that go beyond the proof of functional correctness based on high-level models. Particular challenges are, in particular for formal methods, its heterogeneity…

Software Engineering · Computer Science 2017-05-02 Carna Radojicic , Christoph Grimm , Axel Jantsch , Michael Rathmair

Event-based semantic segmentation has gained popularity due to its capability to deal with scenarios under high-speed motion and extreme lighting conditions, which cannot be addressed by conventional RGB cameras. Since it is hard to…

Computer Vision and Pattern Recognition · Computer Science 2024-03-26 Linglin Jing , Yiming Ding , Yunpeng Gao , Zhigang Wang , Xu Yan , Dong Wang , Gerald Schaefer , Hui Fang , Bin Zhao , Xuelong Li

This paper is devoted to the use of hybrid Petri nets (PNs) for modeling and control of hybrid dynamic systems (HDS). Modeling, analysis and control of HDS attract ever more of researchers' attention and several works have been devoted to…

Information Theory · Computer Science 2007-07-13 Latéfa Ghomri , Hassane Alla

This paper lays a practical foundation for using abstract interpretation with an abstract domain that consists of sets of quantified first-order logic formulas. This abstract domain seems infeasible at first sight due to the complexity of…

Logic in Computer Science · Computer Science 2024-08-20 Eden Frenkel , Tej Chajed , Oded Padon , Sharon Shoham

Hamiltonian representations based on the sum-of-squares (SOS) hierarchy provide rigorous lower bounds on ground-state energies and facilitate the design of efficient classical and quantum simulation algorithms. This work presents a unified…

Quantum Physics · Physics 2026-02-06 Nicholas C. Rubin , Guang Hao Low , A. Eugene DePrince

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

Symbolic Computation · Computer Science 2026-05-22 Thi Xuan Vu