期刊文献+

时间自动机状态空间的一个极小化构造方法 被引量:1

Minimizing state space of timed automata
下载PDF
导出
摘要 对时间自动机的转换系统进行改进,提出了一个状态空间的极小化构造方法。该方法用位置和停留在该位置时的可能时钟值集合来表示状态,以此隐藏因时间流逝而引发的无穷状态,得到了改进的转换系统——时间段转换系统;并通过对转换可能发生时间的分析,去除无效转换;然后使用转换互模拟合并等价状态,实现了状态空间的极小化,有效地避免了状态空间爆炸。 In this paper,we develope the traditional transition system and advance a method of state space minimization.The method describes the state by location and the possible set of clocks staying in this location.We name that as time segment transition system.It hid the infinite state which is brought by time elapsing.We remove the invalid transition by analyzing the possible occurring time of the transition.Then we minimize the transition system by utilizing the transition bi-simulation,and avoide the state-space-explosion problem effectively.
出处 《计算机工程与应用》 CSCD 北大核心 2007年第14期30-33,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.69873040)~~
关键词 时间自动机 转换系统 可达性 状态空间 模型检测 timed automata transition systems teachability state space model checking
  • 相关文献

参考文献7

  • 1Alur R,Dill D L.Automata for modeling real-time systems[C]//LNCS:Proc 17th International Colloquium on Automata,Languages and Programming,1990,443:322-335.
  • 2Alur R.Timed automata[C]//NATO-AST 1998 Summer School on Verification of Digital and Hybrid Systems,1998.
  • 3Heitmeyer C,Jeffords R,Labaw B.Comparing different approaches for specifying and verifying real-time systems[C]//Proc 10th IEEE Workshop on Real-Time Operating Systems and Software,May 1993.
  • 4宋煌,庄雷,苏锦祥,周清雷.一种改进的区域自动机构造方法[J].计算机研究与发展,2002,39(5):607-611. 被引量:2
  • 5Kang I.An efficient state space generation for analysis of real time system[J].ACM Transaction on Computer,1996.
  • 6Strling C.Bisimulation,model checking and other[C]//Mathfit Instructional Meeting on Games and Computation,Univeristy of Edinburgn,1993.
  • 7Cerans K.Decidability of bisimulation equivalence for parallel timer processes[C]//LNCS 663:Proceedings of the Fourth Workshop on Computer-Aided Verification,Springer-Verlag,1992:302-315.

二级参考文献8

  • 1[1]S Aggarwal,R P Kurahan,D Sharma.A language for specification and analysis of protocols.IFIP Protocol Specification,Testing and verification,1983,3:181~402
  • 2[2]E M Clarke,E A Emerson,A P Sistla.Automatic verification of finite-state concurrent systems using temporal-logic specifications.ACM Trans on Programming Languages Systems,1986,8(2):244~263
  • 3[3]M C Browne,E M Clarke,D L Dill et al.Automatic verification of sequential circuits using temporal logic.IEEE Trans on Computer System Science,1986,8:117~141
  • 4[4]R Alur,D L Dill.A theory of timed automata.Theoretical Computer Science,1994,126:183~235
  • 5[5]R S Cohen,A Y Gold.Theory of ω-language.Journal of Computer and System Science,1977,15:168~184
  • 6[6]R Alur,A Itai,R P Kurshan et al.Timing verification by successive approximation.Information and Computation,1995,118:142~157
  • 7[7]A P Sistla,M Vardi,P Wolper.The complementation problem for Büchi automation with application to temporal logic.Theoretical Computer Science,1987,49:217~237
  • 8[8]Safra S.On the complexity of ω-automata.In:Proc of the 29th IEEE Symp on Foundations of Computer Science,1988.319~327

共引文献1

同被引文献10

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部