有限精度时间自动机的可达性检测-软件学报.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.17, No.1, January 2006, pp .1− 10 DOI: 10. 1360/jos170001 Tel/Fax : +86-10 © 2006 by Journal of Software. All rights reserved. ∗ 有限精度时间自动机的可达性检测 1,2+ 1 1,2 1,2 1 晏荣杰 , 李广元 , 徐雨波 , 刘春明 , 唐稚松 1( 中国科学院 软件研究所 计算机科学重点实验室,北京 100080) 2( 中国科学院 研究生院,北京 100049) Reachability Checking of Finite Precision Timed Automata 1,2+ 1 1,2 1,2 1 YAN Rong-Jie , LI Guang-Yuan , XU Yu-Bo , LIU Chun-Ming , TANG Zhi-Song 1(Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100080, China) 2(Graduate School, The Chinese Academy of Sciences, Beijing 100049, China) + Corresponding author: Phn: +86-10 Fax: +86-10 E-mail: yrj@, Yan RJ, Li GY, Xu YB, Liu CM, Tang ZS. Reachability checking of finite precision timed automata. Journal of Software, 2006,17(1):1−10. /1000-9825/17/1.htm Abstract: To relieve the state space explosion problem, and accelerate the speed of model checking, this paper introduces the concept of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. FPTAs only record the integer values of clock variables together with the order of their most recent resets to reduce the state space. The constraints under which the reachability checking of a timed automaton can be reduced to that of the corresponding FPTA are provided, and then an algorithm for reachability analysis is presented. Finally, the paper pre