Authors:
Hao Ren
1
;
Ratnesh Kumar
2
and
Matthew A. Clark
3
Affiliations:
1
Honeywell Aerospace Advanced Technology, 12001 Hwy 55, Plymouth, MN and U.S.A.
;
2
Department of Electrical and Computer Engineering, Iowa State University, Ames, IA and U.S.A.
;
3
Galois Inc., 444 E 2nd St, Dayton, OH and U.S.A.
Keyword(s):
Quantifier Elimination, Compositional Verification, System Property Composition.
Related
Ontology
Subjects/Areas/Topics:
Engineering Applications
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Modeling, Analysis and Control of Hybrid Dynamical Systems
;
Robotics and Automation
;
Signal Processing, Sensors, Systems Modeling and Control
;
System Modeling
Abstract:
We present our work on the role and integration of quantifier elimination (QE) for compositional verification. In our approach, we derive in a single step, the strongest system property from the given component properties. This formalism is first developed for time-independent properties, and later extended to the case of time-dependent property composition. The extension requires additional work of replicating the given properties by shifting those along time so the entire time-horizon of interest is captured. We show that the time-horizon of a system property is bounded by the sum of the time-horizons of the component properties. The system initial condition can also be composed, which, alongside the strongest system property, are used to verify a postulated system property through induction. The above approaches are implemented in our prototype tool called ReLIC (Reduced Logic Inference for Composition) and demonstrated through several examples.