期刊文献+

可调整时间自动机可达性算法的研究 被引量:1

Study on reachability algorithm on updatable timed automata
下载PDF
导出
摘要 可调整时间自动机在时间自动机的基础上扩展了时钟调整形式,是一种有效描述实时系统行为的计算模型,借助这种模型对实时系统进行分析、设计、验证能够保证较高的可靠性。研究其可达性算法是保证系统可靠性的理论基础,文中给出适用于时钟调整形式的EDBM操作并提出一种可达性算法,针对对角线约束情况给出一种对角线约束筛选算法保证了算法的正确性。 Updatable timed automata extends time automata with updates, which is an efficient computational model to describe the behavior of real-time system, using this model for real-time system when analyzing, designing and verifying ensures high reliability. The study on reachability algorithm is the theoretical foundation of system reliability. This paper provides the EDBM operation with updates and a reachability algorithm, a selection algorithm of diagonal constraints ensures the correctness of updatable timed automata with diagonal constraints.
作者 李岩
出处 《信息技术》 2014年第9期4-7,共4页 Information Technology
基金 国家自然科学基金(NSFC 61100052)
关键词 (可调整)时间自动机 扩展差分限界矩阵 对角线约束 可达性算法 (updatable) timed automata EDBM diagonal constraint reachability algorithm
  • 相关文献

参考文献8

  • 1Rajeev Alur,David Dill.A theory of timed automata[J].Theoretical Computer Science,1994,126:183-235.
  • 2Waez M T B,Dingel J,Rudie K.A survey of timed automata for the development of real-time systems[J].Computer Science Review,2013:9:1-26.
  • 3Bouyer P,Dufourd C,Fleury E,et al.Updatable timed automata[J].Theoretical Computer Science,2004,321 (2):291-345.
  • 4Daws C,Tripakis S.Model checking of real-time reachability properties using abstractions[M].Tools and Algorithms for the Construction and Analysis of Systems.Springer Berlin Heidelberg,1998:313-329.
  • 5Bouyer P,Laroussinie F,Reynier P A.Diagonal Constraints in Timed Automata[C]//Proc.3rd Int.Conf.on Formal.Modelling and Analysis of Timed Systems,2005,3829:112-126.
  • 6Bengtsson J,Yi W.Timed automata:Semantics,algorithms and tools[M].Lectures on Concurrency and Petri Nets.Springer Berlin Heidelberg,2004:87-124.
  • 7Bérard B,Petit A,Diekert V,et al.Characterization of the expressive power of silent transitions in timed automata[J].Fundamenta Informaticae,1998,36(2):145-182.
  • 8Bouyer P.Untameable timed automata[M].STACS 2003.Springer Berlin Heidelberg,2003:620-631.

同被引文献10

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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