English
Related papers

Related papers: Practical Livelock Analysis in Parameterized Unidi…

200 papers

This paper presents a method to verify closed-loop properties of optimization-based controllers for deterministic and stochastic constrained polynomial discrete-time dynamical systems. The closed-loop properties amenable to the proposed…

Optimization and Control · Mathematics 2016-11-16 Milan Korda , Colin N. Jones

Currently, identification of crystallization pathways in polymers is being carried out using molecular simulation-based data on a preset cut-off point on a single order parameter (OP) to define nucleated or crystallized regions. Aside from…

Computational Physics · Physics 2025-07-25 Elyar Tourani , Brian J. Edwards , Bamin Khomami

Synchronous update schemes in p-bit annealing offer a natural route to massive parallelism, but they can also induce period-2 oscillations that degrade optimization performance. In practical solvers, such oscillations matter only if they…

Statistics Theory · Mathematics 2026-03-30 Naoya Onizawa , Shunsuke Koshita , Takahiro Hanyu

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…

Logic in Computer Science · Computer Science 2024-04-09 Niklas Kochdumper , Stanley Bak

We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…

Graphics · Computer Science 2024-08-01 Ryan Capouellez , Denis Zorin

We present an algorithm that takes as input a graph $G$ with weights on the vertices, and computes a maximum weight independent set $S$ of $G$. If the input graph $G$ excludes a path $P_k$ on $k$ vertices as an induced subgraph, the…

Data Structures and Algorithms · Computer Science 2020-06-09 Peter Gartland , Daniel Lokshtanov

Guarded protocols were introduced in a seminal paper by Emerson and Kahlon (2000), and describe systems of processes whose transitions are enabled or disabled depending on the existence of other processes in certain local states. We study…

Logic in Computer Science · Computer Science 2016-09-05 Simon Außerlechner , Swen Jacobs , Ayrat Khalimov

Deciding feasibility of large systems of linear equations and inequalities is one of the most fundamental algorithmic tasks. However, due to data inaccuracies or modeling errors, in practical applications one often faces linear systems that…

Data Structures and Algorithms · Computer Science 2022-09-07 Kristóf Bérczi , Alexander Göke , Lydia Mirabel Mendoza-Cadena , Matthias Mnich

We generalize the polynomial-time outcome-complete simulation algorithm for stabilizer circuits in arXiv:2309.08676 to track global phases exactly, yielding what we call phased outcome-complete simulation. The original algorithm enabled…

Quantum Physics · Physics 2026-03-27 Vadym Kliuchnikov , Adam Paetznick , Marcus P. da Silva

Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thilikos [JACM'05] and the treewidth-pattern-covering approach by…

Data Structures and Algorithms · Computer Science 2026-04-02 Matthias Bentert , Fedor V. Fomin , Petr A. Golovach

We systematically survey the literature on analytically sound multiprocessor real-time locking protocols from 1988 until 2018, covering the following topics: progress mechanisms that prevent the lock-holder preemption problem, spin-lock…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-23 Björn B. Brandenburg

Continuous monitoring of one-dimensional free fermionic systems can generate phenomena reminiscent of quantum criticality, such as logarithmic entanglement growth, algebraic correlations, and emergent conformal invariance, but in a…

Quantum Physics · Physics 2026-05-12 Clemens Niederegger , Tatiana Vovk , Elias Starchl , Lukas M. Sieberer

A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to…

Data Structures and Algorithms · Computer Science 2017-11-28 Krishnendu Chatterjee , Wolfgang Dvořák , Monika Henzinger , Veronika Loitzenbauer

Unbreakable decomposition, introduced by Cygan et al. (SICOMP'19) and Cygan et al. (TALG'20), has proven to be one of the most powerful tools for parameterized graph cut problems in recent years. Unfortunately, all known constructions…

Data Structures and Algorithms · Computer Science 2024-08-20 Aditya Anand , Euiwoong Lee , Jason Li , Yaowei Long , Thatchaphol Saranurak

Scalable formal verification constitutes an important challenge for the design of asynchronous circuits. Deadlock freedom is a property that is desired but hard to verify. It is an emergent property that has to be verified monolithically.…

Logic in Computer Science · Computer Science 2013-05-01 Freek Verbeek , Julien Schmaltz

One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC^0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing…

Computational Complexity · Computer Science 2017-11-07 Roei Tell

Instantaneous measurements of non-local observables between space-like separated regions can be performed without violating causality. This feat relies on the use of entanglement. Here we propose novel protocols for this task and the…

Quantum Physics · Physics 2015-05-20 Salman Beigi , Robert Koenig

Pulse timing is an important topic in nuclear instrumentation, with far-reaching applications from high energy physics to radiation imaging. While high-speed analog-to-digital converters become more and more developed and accessible, their…

Instrumentation and Detectors · Physics 2023-09-28 Pengcheng Ai , Le Xiao , Zhi Deng , Yi Wang , Xiangming Sun , Guangming Huang , Dong Wang , Yulei Li , Xinchi Ran

This paper proposes a dynamic quantum-assisted co-design framework for nonlinear closed-loop systems in which controller parameters and Lyapunov-certificate parameters are redesigned jointly at successive decision epochs. Unlike…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Milad Hasanzadeh , Amin Kargarian , Mehdi Farasat

The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional entanglement criteria measuring coherent superpositions of multiple basis states face experimental…

Quantum Physics · Physics 2026-02-12 Jin-Min Liang , Shuheng Liu , Shao-Ming Fei , Qiongyi He