loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 First International Multi-Symposiums on Computer and Computational Sciences
Combining Couvreur?s Algorithm with Bitstate-Hashing for Emptiness Check
Hangzhou, Zhejiang, China
June 20-June 24
ISBN: 0-7695-2581-4
ASCII Text
x 
 
Yige Li, Kanglin Xie, Tao Hao, "Combining Couvreur?s Algorithm with Bitstate-Hashing for Emptiness Check," Computer and Computational Sciences, International Multi-Symposiums on, vol. 2, pp. 283-286, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006.
 
 
BibTex
x
 
@article{ 10.1109/IMSCCS.2006.200,
author = {Yige Li and Kanglin Xie and Tao Hao},
title = {Combining Couvreur?s Algorithm with Bitstate-Hashing for Emptiness Check},
journal ={Computer and Computational Sciences, International Multi-Symposiums on},
volume = {2},
year = {2006},
isbn = {0-7695-2581-4},
pages = {283-286},
doi = {http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.200},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Computational Sciences, International Multi-Symposiums on
TI - Combining Couvreur?s Algorithm with Bitstate-Hashing for Emptiness Check
SN - 0-7695-2581-4
SP283
EP286
A1 - Yige Li,
A1 - Kanglin Xie,
A1 - Tao Hao,
PY - 2006
KW - null
VL - 2
JA - Computer and Computational Sciences, International Multi-Symposiums on
ER -
 
Yige Li, Shanghai Jiao Tong University, China
Kanglin Xie, Shanghai Jiao Tong University, China
Tao Hao, Shanghai Jiao Tong University, China
Emptiness check is very important in model checking to LTL.In this paper we first present a new emptiness checking algorithm,which is based on Couvreur?s algorithm in [3],to make it be compatible with bitstate-hashing completely.And then we show the correctness of the improved algorithm by analyzing it and Couvreur?s algorithm.At last,we make the experiment to compare the improved algorithm to several known algorithms,which will show its interaction with bitstate-hashing completely while keeping the performance on the whole.This expands the usefulness of Couvreur?s algorithm largely.
Citation:
Yige Li, Kanglin Xie, Tao Hao, "Combining Couvreur?s Algorithm with Bitstate-Hashing for Emptiness Check," imsccs, vol. 2, pp.283-286, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.