Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Reachability analysis for cyber-physical systems: Are we there yet?
Reachability analysis is a fundamental problem in verification that checks for a given model
and set of initial states if the system will reach a given set of unsafe states. Its importance lies …
and set of initial states if the system will reach a given set of unsafe states. Its importance lies …
Approximation-refinement testing of compute-intensive cyber-physical models: An approach based on system identification
Black-box testing has been extensively applied to test models of Cyber-Physical systems
(CPS) since these models are not often amenable to static and symbolic testing and …
(CPS) since these models are not often amenable to static and symbolic testing and …
DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems
We present the DryVR framework for verifying hybrid control systems that are described by a
combination of a black-box simulator for trajectories and a white-box transition graph …
combination of a black-box simulator for trajectories and a white-box transition graph …
Abstraction and counterexample-guided refinement in model checking of hybrid systems
Hybrid dynamic systems include both continuous and discrete state variables. Properties of
hybrid systems, which have an infinite state space, can often be verified using ordinary …
hybrid systems, which have an infinite state space, can often be verified using ordinary …
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
This paper deals with the problem of safety verification of nonlinear hybrid systems. We start
from a classical method that uses interval arithmetic to check whether trajectories can move …
from a classical method that uses interval arithmetic to check whether trajectories can move …
Safety verification of hybrid systems by constraint propagation based abstraction refinement
This paper deals with the problem of safety verification of non-linear hybrid systems. We start
from a classical method that uses interval arithmetic to check whether trajectories can move …
from a classical method that uses interval arithmetic to check whether trajectories can move …
Formal verification of timed systems: A survey and perspective
F Wang - Proceedings of the IEEE, 2004 - ieeexplore.ieee.org
An overview of the current state of the art of formal verification of real-time systems is
presented. We discuss commonly accepted models, specification languages, verification …
presented. We discuss commonly accepted models, specification languages, verification …
Predicate abstraction for reachability analysis of hybrid systems
Embedded systems are increasingly finding their way into a growing range of physical
devices. These embedded systems often consist of a collection of software threads …
devices. These embedded systems often consist of a collection of software threads …
Verification of hybrid systems based on counterexample-guided abstraction refinement
Hybrid dynamic systems include both continuous and discrete state variables. Properties of
hybrid systems, which have an infinite state space, can often be verified using ordinary …
hybrid systems, which have an infinite state space, can often be verified using ordinary …
Beautiful interpolants
We describe a compositional approach to Craig interpolation based on the heuristic that
simpler proofs of special cases are more likely to generalize. The method produces simple …
simpler proofs of special cases are more likely to generalize. The method produces simple …