System Verification by Model Checking

2008 ◽  
pp. 375-412
Author(s):  
Fred Kröger ◽  
Stephan Merz
Keyword(s):  
Model Checking ◽  
System Verification

HYBRID SYSTEM VERIFICATION IS NOT A SINECURE — THE ELECTRONIC THROTTLE CONTROL CASE STUDY

2006 ◽  
Vol 17 (04) ◽  
pp. 885-901 ◽  
Author(s):  
ANSGAR FEHNKER ◽  
BRUCE KROGH
Keyword(s):  
Model Checking ◽  
Hybrid System ◽  
Formal Model ◽  
Control Case ◽  
Automotive Control ◽  
Electronic Throttle ◽  
System Verification ◽  
Automated Process ◽  
Informal Description

Though model checking itself is a fully automated process, verifying correctness of a hybrid system design using model checking is not. This paper describes the necessary steps, and choices to be made, to go from an informal description of the problem to the final verification result for a formal model and requirement. It uses an automotive control system for illustration.

An Efficient Specification for System Verification

2006 ◽  
Vol 10 (6) ◽  
pp. 931-938
Author(s):  
Chikatoshi Yamada ◽  
◽  
Yasunori Nagata ◽  
Zensho Nakao ◽  
Keyword(s):  
Model Checking ◽  
Execution Time ◽  
Large Scale ◽  
Large Scale Systems ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Specification Method ◽  
System Verification ◽  
Temporal Formula ◽  
Temporal Specification

In design of complex and large scale systems, system verification has played an important role. In this article, we focus on specification process of model checking in system verifications. Modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method by which specifications with temporal formulas are obtained inductively. We will show verification results using the proposed temporal formula specification method, and show that amount of memory, OBDD nodes, and execution time are reduced.

scholarly journals Towards a Statistical Model Checking Method for Safety-Critical Cyber-Physical System Verification

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jian Xie ◽  
Wenan Tan ◽  
Bingwu Fang ◽  
Zhiqiu Huang
Keyword(s):  
Model Checking ◽  
Statistical Model ◽  
Importance Sampling ◽  
Physical System ◽  
Estimation Method ◽  
Environmental Damage ◽  
Cyber Physical System ◽  
Statistical Model Checking ◽  
Safety Critical ◽  
System Verification

Safety-Critical Cyber-Physical System (SCCPS) refers to the system that if the system fails or its key functions fail, it will cause casualties, property damage, environmental damage, and other catastrophic consequences. Therefore, it is vital to verify the safety of safety critical systems. In the community, the SCCPS safety verification mainly relies on the statistical model checking methodology, but for SCCPS with extremely high safety requirements, the statistical model checking method is difficult/infeasible to sample the extremely small probability event since the probability of the system violating the safety is very low (rare property). In response to this problem, we propose a new method of statistical model checking for high-safety SCCPS. Firstly, with the CTMC-approximated SCCPS path probability space model, it leverages the maximum likelihood estimation method to learn the parameters of CTMC. Then, the embedded DTMC can be derived from CTMC, and a cross-entropy optimization model based on DTMC can be constructed. Finally, we propose an algorithm of iteratively learning the optimal importance sampling distribution on the discrete path space and an algorithm to check the statistical model of verifying the rare attribute. Eventually, experimental results show that the method proposed in this paper can effectively verify the rare attributes of SCCPS. Under the same sample size, comparing with the heuristic importance sampling methods, the estimated value of this method can be better distributed around the mean value, and the related standard deviation and relative error are reduced by more than an order of magnitude.

Inductive Temporal Formula Specifications for System Verification

2005 ◽  
Vol 9 (3) ◽  
pp. 321-328
Author(s):  
Chikatoshi Yamada ◽  
◽  
Yasunori Nagata ◽  
Zensho Nakao ◽  
Keyword(s):  
Model Checking ◽  
Complex Systems ◽  
Large Scale ◽  
Design Verification ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
System Verification ◽  
Temporal Formula ◽  
Temporal Specification

Design verification has played an important role in the design of large scale and complex systems. In this article, we focus on model checking methods. Behaviors of modeled systems are in general specified by temporal formulas of computation tree logic, and users must know well about temporal specification because the specification might be complex. We propose a method temporal formulas are obtained inductively, and amounts of memory and time are reduced. We will show verification results using the proposed method.

Model-Checking of Infinite Graphs Defined by Graph Grammars

2000 ◽  
Vol 5 ◽  
pp. 1 ◽  
Author(s):  
O BURKART ◽  
Y QUEMENER
Keyword(s):  
Model Checking ◽  
Infinite Graphs ◽  
Graph Grammars
Sign in / Sign up

Export Citation Format

Share Document