A State Space Reduction Method for Model Checking of Wireless Multi-Hop Network Routing Protocols Focusing on Topologies

2019 ◽  
Author(s):  
Hideharu Kojima ◽  
Naoto Yanai
Keyword(s):  
Model Checking ◽  
State Space ◽  
Routing Protocols ◽  
Reduction Method ◽  
Network Routing ◽  
Space Reduction ◽  
State Space Reduction

State Space Reduction for Model Checking Agent Programs

2012 ◽  
pp. 133-151
Author(s):  
Sung-Shik T. Q. Jongmans ◽  
Koen V. Hindriks ◽  
M. Birna van Riemsdijk
Keyword(s):  
Model Checking ◽  
State Space ◽  
Space Reduction ◽  
State Space Reduction

SLICING EXECUTION FOR MODEL CHECKING C PROGRAMS

2006 ◽  
Vol 16 (05) ◽  
pp. 747-768 ◽  
Author(s):  
XIAODONG YI ◽  
JI WANG ◽  
XUEJUN YANG
Keyword(s):  
Model Checking ◽  
State Space ◽  
Considerable Improvement ◽  
Safety Properties ◽  
C Programs ◽  
Space Reduction ◽  
Efficient Reduction ◽  
Ssl Protocol ◽  
Novel Method ◽  
State Space Reduction

This paper presents a novel method, namely slicing execution, for model checking C programs with respect to temporal safety properties. The distinguished feature is that it shows a nice approach to the efficient reduction of state space by abstraction and symbolic representation. Slicing execution is founded on an over-approximated semantics of C programs by variable abstraction, and executes symbolically only the relevant statements under abstraction criteria to construct over-approximated finite models of programs, which may be model checked. The variable abstraction criterion begins with a proper initial set of program variables and may be iteratively refined according to spurious counterexamples generated during model checking. In general, the properties to be verified often involve only a few variables in practical programs. In these cases, significant state space reduction, as well as considerable improvement of the scalability, may be achieved. The presented method has been used to verify the initial handshake process of SSL protocol based on the C source code of openssl-0.9.6c. The experiment results confirm that slicing execution is not only practical but also effective.

scholarly journals Parrondo Games with Spatial Dependence, III

2015 ◽  
Vol 14 (04) ◽  
pp. 1550039 ◽  
Author(s):  
S. N. Ethier ◽  
Jiyeon Lee
Keyword(s):  
Computer Graphics ◽  
Markov Chains ◽  
State Space ◽  
Spatial Dependence ◽  
Reduction Method ◽  
One Dimensional ◽  
Space Reduction ◽  
State Space Reduction

We study Toral’s Parrondo games with [Formula: see text] players and one-dimensional spatial dependence as modified by Xie et al. Specifically, we use computer graphics to sketch the Parrondo and anti-Parrondo regions for [Formula: see text]. Our work was motivated by a recent paper of Li et al., who applied a state space reduction method to this model, reducing the number of states from [Formula: see text] to [Formula: see text]. We show that their reduced Markov chains are inconsistent with the model of Xie et al.

Sign in / Sign up

Export Citation Format

Share Document