The HOL-Voss system: Model-checking inside a general-purpose theorem-prover

1994 ◽  
pp. 185-198 ◽  
Author(s):  
Jeffrey Joyce ◽  
Carl Seger
Keyword(s):  
Model Checking ◽  
General Purpose ◽  
Theorem Prover ◽  
System Model

An Efficient Algorithm to Understand Long Counterexample

2013 ◽  
Vol 328 ◽  
pp. 254-260
Author(s):  
Zhi Yuan Chen ◽  
Shao Bin Huang ◽  
Ming Yu Ji ◽  
Lin Shan Shen
Keyword(s):  
Model Checking ◽  
Efficient Algorithm ◽  
System Model ◽  
Experimental Result ◽  
Boolean Formula ◽  
Abstract Model ◽  
System State ◽  
Guide System ◽  
Model Improvement ◽  
Model Failure

For given system to proceed model checking, if system model is discontent with the quality which to be detected, model detector will give counterexample, it will cause the generated counterexample too long when system state-space is very large, it is a very important problem, how to find the reason of model failure from long counterexample quickly, the article uses extractive technique of minimal unsatisfiable subformula to put forward a kind of understanding counterexample way which is extracted minimal unsatisfiable subformula quickly from Boolean formula. The algorithm can pinpoint error and find the reason of model failure. Experimental result indicated that understanding counterexample is based on minimal unsatisfiable subformula can accelerate understanding counterexample speed, improve the efficient of debugging, guide system abstract model improvement effectively.

Model Checking for SpaceWire Error Detection Module

2012 ◽  
Vol 241-244 ◽  
pp. 3020-3025
Author(s):  
Ling Ling Dong ◽  
Yong Guan ◽  
Xiao Juan Li ◽  
Zhi Ping Shi ◽  
Jie Zhang ◽  
...  
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Temporal Logic ◽  
Error Detection ◽  
System Model ◽  
Linear Search ◽  
Kripke Structure ◽  
Mathematical Methods ◽  
Safety Critical ◽  
Correctness Of Programs

Considerable attention has been devoted to prove the correctness of programs. Formal verification overcomes the incompleteness by applying mathematical methods to verify a design. SpaceWire is a well known communication standard. For safety-critical applications an approach is needed to validate the completeness of SpareWire design. This paper addresses formal verification of SpareWire error detection module. The system model was constructed by Kripke structure, and the properties were presented by linear temporal logic (LTL). Compared the verification of LTL with CTL (branch temporal logic), LTL properties could improve the verification efficiency due to its linear search. The error priority was checked using simulation guided by model checking. After some properties were modified, all possible behaviors of the module satisfied the specification. This method realizes complete validation of the error detection module.

Probabilistic Analysis Using Theorem Proving

2015 ◽  
pp. 21-28
Keyword(s):  
Model Checking ◽  
Theorem Proving ◽  
Probabilistic Analysis ◽  
Probabilistic Model ◽  
Higher Order ◽  
Order Logic ◽  
Theorem Prover ◽  
Probabilistic Model Checking ◽  
Higher Order Logic ◽  
Comprehensive Framework

In this chapter, the authors first provide the overall methodology for the theorem proving formal probabilistic analysis followed by a brief introduction to the HOL4 theorem prover. The main focus of this book is to provide a comprehensive framework for formal probabilistic analysis as an alternative to less accurate techniques like simulation and paper-and-pencil methods and to other less scalable techniques like probabilistic model checking. For this purpose, the HOL4 theorem prover, which is a widely used higher-order-logic theorem prover, is used. The main reasons for this choice include the availability of foundational probabilistic analysis formalizations in HOL4 along with a very comprehensive support for real and set theoretic reasoning.

General-purpose lidar system model with experimental validation in fog, oil, and smoke conditions

2002 ◽  
Author(s):  
John W. Giles ◽  
Isaac N. Bankman ◽  
Raymond M. Sova ◽  
William J. Green ◽  
Tonette R. King ◽  
...  
Keyword(s):  
Experimental Validation ◽  
General Purpose ◽  
System Model ◽  
Lidar System

scholarly journals Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics

1999 ◽  
Vol 6 (32) ◽  
Author(s):  
Luca Aceto ◽  
Francois Laroussinie
Keyword(s):  
Computational Complexity ◽  
Model Checking ◽  
Timed Automata ◽  
Structural Complexity ◽  
Modal Logics ◽  
System Model ◽  
Model Checker ◽  
Program Complexity

This paper studies the structural complexity of model checking<br />for (variations on) the specification formalisms used in the tools CMC<br />and Uppaal, and fragments of a timed alternation-free mu-calculus. For<br />each of the logics we study, we characterize the computational complexity<br />of model checking, as well as its specification and program complexity,<br />using timed automata as our system model.

scholarly journals Momba: JANI Meets Python

2021 ◽  
pp. 389-398
Author(s):  
Maximilian A. Köhl ◽  
Michaela Klauck ◽  
Holger Hermanns
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Programming Language ◽  
Quantitative Model ◽  
General Purpose ◽  
Ease Of Use ◽  
Formal Models ◽  
Interchange Format ◽  
Model Interchange ◽  
Interacting Automata

AbstractJANI-model [6] is a model interchange format for networks of interacting automata. It is well-entrenched in the quantitative model checking community and allows modeling a variety of systems involving concurrency, probabilistic and real-time aspects, as well as continuous dynamics. Python is a general purpose programming language preferred by many for its ease of use and vast ecosystem. In this paper, we present Momba, a flexible Python framework for dealing with formal models centered around the JANI-model format and formalism. Momba strives to deliver an integrated and intuitive experience for experimenting with formal models making them accessible to a broader audience. To this end, it provides a pythonic interface for model construction, validation, and analysis. Here, we demonstrate these capabilities.

Sign in / Sign up

Export Citation Format

Share Document