English
Related papers

Related papers: Generalized Property-Directed Reachability for Hyb…

200 papers

Hybrid systems with both discrete and continuous dynamics are an important model for real-world cyber-physical systems. The key challenge is to ensure their correct functioning w.r.t. safety requirements. Promising techniques to ensure…

Logic in Computer Science · Computer Science 2015-05-27 Stefan Mitsch , Grant Olney Passmore , Andre Platzer

Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the…

Computational Complexity · Computer Science 2015-07-01 Matthew Hague , C. -H. Luke Ong

Resolvers, like all electromagnetic devices, are constantly under investigation, both operationally and structurally. In this regard, proposing a modeling methodology that can save significant time without compromising accuracy is a big…

Systems and Control · Electrical Eng. & Systems 2025-05-15 MohammadSadegh KhajueeZadeh , Farid Tootoonchian , Ali Pourghoraba

Property checking of RTL designs is a central task in formal verification. Among available engines, IC3/PDR is a widely used backbone whose performance critically depends on inductive generalization, the step that generalizes a concrete…

Hardware Architecture · Computer Science 2026-03-02 Mingkai Miao , Guangyu Hu , Wei Zhang , Hongce Zhang

Hybrid systems play a crucial role in modeling real-world applications where discrete and continuous dynamics interact, including autonomous vehicles, power systems, and traffic networks. Safety verification for these systems requires…

Systems and Control · Electrical Eng. & Systems 2026-02-18 Peng Xie , Johannes Betz , Davide M. Raimondo , Amr Alanwar

Model checking is an automatic formal verification technique that is widely used in hardware verification. The state-of-the-art complete model-checking techniques, based on IC3/PDR and its general variant CAR, are based on computing…

Logic in Computer Science · Computer Science 2024-11-04 Yibo Dong , Yu Chen , Jianwen Li , Geguang Pu , Ofer Strichman

We define a new method for taking advantage of net reductions in combination with a SMT-based model checker. Our approach consists in transforming a reachability problem about some Petri net, into the verification of an updated reachability…

Logic in Computer Science · Computer Science 2023-06-22 Nicolas Amat , Bernard Berthomieu , Silvano Dal Zilio

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

We present a formally verified framework for patent analysis as a hybrid AI + Lean 4 pipeline. The DAG-coverage core (Algorithm 1b) is fully machine-verified once bounded match scores are fixed. Freedom-to-operate, claim-construction…

Artificial Intelligence · Computer Science 2026-04-22 George Koomullil

Controlling hybrid systems is mostly very challenging due to the variety of dynamics these systems can exhibit. Inspired by the concept of differential flatness of nonlinear continuous systems and their inherent invertibility property, the…

Systems and Control · Electrical Eng. & Systems 2024-09-23 Tobias Kleinert , Veit Hagenmeyer

Hybrid model predictive control with both continuous and discrete variables is widely applicable to robotic control tasks, especially those involving contact with the environment. Due to the combinatorial complexity, the solving speed of…

Robotics · Computer Science 2025-12-18 Xuan Lin

The wide deployment of deep neural networks, though achieving great success in many domains, has severe safety and reliability concerns. Existing adversarial attack generation and automatic verification techniques cannot formally verify…

Machine Learning · Computer Science 2020-06-09 Weidi Sun , Yuteng Lu , Xiyue Zhang , Zhanxing Zhu , Meng Sun

We consider the verification of distributed systems composed of an arbitrary number of asynchronous processes. Processes are identical finite-state machines that communicate by reading from and writing to a shared memory. Beyond the…

Formal Languages and Automata Theory · Computer Science 2023-08-01 Nicolas Waldburger

The correctness of many algorithms and data structures depends on reachability properties, that is, on the existence of chains of references between objects in the heap. Reasoning about reachability is difficult for two main reasons. First,…

Programming Languages · Computer Science 2019-08-19 Arshavir Ter-Gabrielyan , Alexander J. Summers , Peter Müller

Hamilton-Jacobi (HJ) reachability analysis is a widely used method for ensuring the safety of robotic systems. Traditional approaches compute reachable sets by numerically solving an HJ Partial Differential Equation (PDE) over a grid, which…

Robotics · Computer Science 2025-05-08 Zeyuan Feng , Le Qiu , Somil Bansal

We introduce a new approach to analyze distributed hybrid systems by a generalization of rely-guarantee reasoning. First, we give a system for deductive verification of class invariants and method contracts in object-oriented distributed…

Logic in Computer Science · Computer Science 2023-09-20 Eduard Kamburjan

Reachability analysis is used to determine all possible states that a system acting under uncertainty may reach. It is a critical component to obtain guarantees of various safety-critical systems both for safety verification and controller…

Systems and Control · Electrical Eng. & Systems 2021-11-03 Jared Mejia , Alex Devonport , Murat Arcak

Hybrid model predictive control (MPC) with both continuous and discrete variables is widely applicable to robotic control tasks, especially those involving contact with the environment. Due to the combinatorial complexity, the solving speed…

Robotics · Computer Science 2023-10-12 Xuan Lin

SMPT (for Satisfiability Modulo Petri Net) is a model checker for reachability problems in Petri nets. It started as a portfolio of methods to experiment with symbolic model checking, and was designed to be easily extended. Some distinctive…

Logic in Computer Science · Computer Science 2023-03-01 Nicolas Amat , Silvano Dal Zilio

This paper presents GenH2R, a framework for learning generalizable vision-based human-to-robot (H2R) handover skills. The goal is to equip robots with the ability to reliably receive objects with unseen geometry handed over by humans in…

Robotics · Computer Science 2024-06-17 Zifan Wang , Junyu Chen , Ziqing Chen , Pengwei Xie , Rui Chen , Li Yi