English
Related papers

Related papers: Lazy Abstraction-Based Controller Synthesis

200 papers

Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis…

Formal Languages and Automata Theory · Computer Science 2018-07-25 Carsten Gerstacker , Felix Klein , Bernd Finkbeiner

This paper introduces a compositional framework for constructing finite abstractions of nonlinear interconnected impulsive systems using dissipativity-based conditions. Central to our approach is the concept of "alternating simulation…

Systems and Control · Electrical Eng. & Systems 2024-12-24 Abdalla Swikir

In human-robot collaboration (HRC), software-based automatic safety controllers (ASCs) are used in various forms (e.g. shutdown mechanisms, emergency brakes, interlocks) to improve operational safety. Complex robotic tasks and increasingly…

Robotics · Computer Science 2025-03-21 Mario Gleirscher , Radu Calinescu

Most of the existing algorithms for approximate Bayesian computation (ABC) assume that it is feasible to simulate pseudo-data from the model at each iteration. However, the computational cost of these simulations can be prohibitive for high…

Design of optimal distributed linear feedback controllers to achieve a desired aggregate behavior, while simultaneously satisfying state and input constraints, is a challenging but important problem in many applications. System level…

Optimization and Control · Mathematics 2022-11-07 Panagiotis D. Grontas , Michael W. Fisher , Florian Dörfler

We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed…

Computer Science and Game Theory · Computer Science 2017-01-11 Corina S. Pasareanu , Radek Pelanek , Willem Visser

In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…

Programming Languages · Computer Science 2007-05-23 R. Giacobazzi , F. Ranzato , F. Scozzari

Approximate Bayes Computations (ABC) are used for parameter inference when the likelihood function of the model is expensive to evaluate but relatively cheap to sample from. In particle ABC, an ensemble of particles in the product space of…

Computation · Statistics 2016-04-15 Carlo Albert , Hans R. Kuensch , Andreas Scheidegger

We introduce the concept of memoryless concretization relation (MCR) to describe abstraction within the context of controller synthesis. This relation is a specific instance of alternating simulation relation (ASR), where it is possible to…

Dynamical Systems · Mathematics 2024-03-22 Julien Calbert , Sébastien Mattenet , Antoine Girard , Raphaël M. Jungers

We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement. Our method uses the abstract semantics of the underlying DSL to find a program $P$ whose abstract behavior satisfies the…

Programming Languages · Computer Science 2017-10-24 Xinyu Wang , Isil Dillig , Rishabh Singh

Approximate Bayesian Computation (ABC) methods are applicable to statistical models specified by generative processes with analytically intractable likelihoods. These methods try to approximate the posterior density of a model parameter by…

Methodology · Statistics 2024-03-11 Sanjay Chaudhuri , Subhroshekhar Ghosh , Kim Cuc Pham

Biological reaction networks often contain what might be called 'hub molecules', which are involved in many reactions. For example, ATP is commonly consumed and produced. When reaction networks contain molecules like ATP, they are difficult…

Quantitative Methods · Quantitative Biology 2013-10-09 Kurt Ehlert , Laurence Loewe

Neural abstractions have been recently introduced as formal approximations of complex, nonlinear dynamical models. They comprise a neural ODE and a certified upper bound on the error between the abstract neural network and the concrete…

Logic in Computer Science · Computer Science 2023-10-03 Alec Edwards , Mirco Giacobbe , Alessandro Abate

Synthesizing safety controllers for general nonlinear systems is a highly challenging task, particularly when the system models are unknown, and input constraints are present. While some recent efforts have explored data-driven safety…

Systems and Control · Electrical Eng. & Systems 2025-03-12 Behrad Samari , Abolfazl Lavaei

Control Barrier Functions (CBF) have provided a very versatile framework for the synthesis of safe control architectures for a wide class of nonlinear dynamical systems. Typically, CBF-based synthesis approaches apply to systems that…

Systems and Control · Electrical Eng. & Systems 2024-02-15 Shuo Yang , Mitchell Black , Georgios Fainekos , Bardh Hoxha , Hideki Okamoto , Rahul Mangharam

In time-critical systems, such as air traffic control systems, it is crucial to design control policies that are robust to timing uncertainty. Recently, the notion of Asynchronous Temporal Robustness (ATR) was proposed to capture the…

Systems and Control · Electrical Eng. & Systems 2023-07-25 Xinyi Yu , Xiang Yin , Lars Lindemann

Symbolic approaches to the control design over complex systems employ the construction of finite-state models that are related to the original control systems, then use techniques from finite-state synthesis to compute controllers…

Optimization and Control · Mathematics 2013-02-18 Majid Zamani , Peyman Mohajerin Esfahani , Rupak Majumdar , Alessandro Abate , John Lygeros

The synthetic control (SC) framework is widely used for observational causal inference with time-series panel data. SC has been successful in diverse applications, but existing methods typically treat the ordering of pre-intervention time…

Machine Learning · Computer Science 2026-01-07 Saeyoung Rho , Cyrus Illick , Samhitha Narasipura , Alberto Abadie , Daniel Hsu , Vishal Misra

The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a series of reasoning steps, we systematically unpack the…

Programming Languages · Computer Science 2015-07-01 Ronald Garcia , Andrew Lumsdaine , Amr Sabry

Multi-agent systems (MAS) enable complex reasoning by coordinating multiple agents, but often incur high inference latency due to multi-step execution and repeated model invocations, severely limiting their scalability and usability in…

Multiagent Systems · Computer Science 2026-01-16 Xi Shi , Mengxin Zheng , Qian Lou