期刊文献+

BACH:线性混成系统有界可达性模型检验工具 被引量:2

BACH:A Toolset for Bounded Reachability Analysis of Linear Hybrid Systems
下载PDF
导出
摘要 混成自动机的模型检验问题非常困难,即使是其中相对简单的一个子类——线性混成自动机,它的可达性问题仍然是不可判定的.现有的相关工具大都使用多面体计算来判定线性混成自动机状态空间的可达集,复杂度高、效率低,无法解决实际应用规模的问题.描述了一个面向线性混成系统有界可达性模型检验工具——BACH(bounded reachability checker),该工具能够沿指定路径(组)对单个线性混成自动机、多个线性混成自动机的组合进行可达性检验,并且在此基础上结合路径遍历技术完成对所有路径的有界可达性检验.实验数据显示,BACH不仅在面向路径可达性检验方面性能优异,可以适用于足够长度的路径,而且在针对所有路径的有界可达性检验时,BACH可以解决的问题规模也远远超过同类工具,已接近工业界应用的要求. The model-checking problem for hybrid systems is very difficult to resolve.Even for a relatively simple class of hybrid systems,the class of linear hybrid automata,the most common problem of reachability is unsolvable.Existing techniques for the reachability analysis of linear hybrid automata do not scale well to problem sizes of practical interest.Instead of developing a tool to perform a reachability checking of the complete state space of linear hybrid automata,a prototype toolset BACH(bounded reachability checker) is presented to perform path-oriented reachability checking and bounded reachability checking of the linear hybrid automata and the compositional linear hybrid systems,where the length of the path being checked can be made very large,and the size of the system can be made large enough to handle problems of practical interest.The experiment data shows that BACH has good performance and scalability and supports the fact that BACH can become a powerful assistant for design engineers in the reachability analysis of linear hybrid automata.
出处 《软件学报》 EI CSCD 北大核心 2011年第4期640-658,共19页 Journal of Software
基金 国家自然科学基金(90818022 61021062) 国家重点基础研究发展计划(973)(2009CB320702) 国家高技术研究发展计划(863)(2009AA01Z148 2007AA010302)
关键词 线性混成系统 线性混成自动机 有界可达性检验 线性规划 linear hybrid system linear hybrid automata bounded reachability analysis linear programming
  • 相关文献

参考文献25

  • 1Henzinger T. The theory of hybrid automata. In: Proc. of the 1 lth Annual IEEE Symp. on Logic in Computer Science (LICS'96). IEEE Computer Society Press, 1996.278-292.
  • 2Kesten Y, Pnueli A, Sifakis J, Yovine S. Integration graphs: A class of decideable hybrid systems. In: Grossman R, Nerode A, Rvan A, Rischel H, eds. Proc. of the Hybrid System. LNCS 736, Springer-Vcrlag, 1993. 179-208. [doi: 10.1007/3-540-57318-6_ 29].
  • 3Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho PH, Nicollin X, Olivero A, Sifakis J, Yovine S. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 1995,138:3-34. [doi: 10.1016/0304-3975(94)00202-T].
  • 4Henzinger T, Kopke PW, Purl A, Varaiya P. What's decidable about hybrid automata? Journal of Computer and System Sciences, 1998,57(1):94-124.
  • 5Henzinger TA, Ho PH, Wong-Toi H. HYTECH: A model checker for hybrid systems. Software Tools for Technology Transfer, 1997,1:110-122. [doi: 10.I007/s100090050008].
  • 6Frehse G. PHAVer: Algorithmic verification of hybrid systems past HyTech. In: Morari M, Thiele L, eds. Proc. of the Int'l Conf. on Hybrid Systems: Computation and Control 2005. LNCS 2289, Springer-Verlag, 2005. 258-273. [doi: 10.1007/s10009-007- 0062-x].
  • 7Henzinger T, Majumdar R. Symbolic model checking for rectangular hybrid systems. In: Graf S, Schwartzbach M, eds. Proc. of the 6th Workshop on Tools and Algorithms for the Construction and Analysis of Systems. LNCS 1785, Springer-Vedag, 2000. 142-156. [doi: 10.1007/3-540-46419-0_11].
  • 8Zhou C, Zhang J, Yang L, Li X. Linear duration invariants. In: Langmaack H, Roever W, Vytopil J, eds. Proc. of the Formal Techniques in Real-Time and Fault-Tolerant Systems. LNCS 863, Berlin: Springer-Verlag, 1994. 86-109.
  • 9Li X, Dang V, Zhcng T. Checking hybrid automata for linear duration invariants. In: Shyamasundar R, Ueda K, eds. Advances in Computing Science (AS IAN'97). LNCS 1345, Springer-Verlag, 1997.166- 180. [dol: 10.1007/3 -540-63875 -X_51 ].
  • 10Li X, Zhao J, Pei Y, Li Y, Zheng T, Zheng G. Positive loop-closed automata: A decidable class of hybrid systems. Journal of Logic and Algebraic Programming, 2002,52-53:79-108. [dol: 10.1016/S 1567-8326(02)00023-1].

同被引文献7

  • 1Alur R,Courcoubetis C,Halbwachs N,et al.The algorithmic analysis of hybrid systems[].Theoretical Computer Science.1995
  • 2Thomas A Henzinger.The theory of hybrid automata[].Proceedings of the th Annual IEEE Symposium on Logic in Computer Science LICS’.1996
  • 3Goran Frehse.PHAVer:Algorithmic verification of hybrid systems past HyTech[].Manfred Morari and Lothar Thiele editors Hybrid Systems:Computation and Control (HSCC’’).2005
  • 4Cousot P,Cousot R.Abstract interpretation:a unified lattice model for static analysis of programs by construction or approximation of fixpoints[].Proceedings of the Sixth An-nual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.1977
  • 5Sankaranarayanan S,Tiwari A.Relational abstractions for con-tinuous and hybrid systems[].Proceedings of therd In-ternational Conference on Computer Aided Verification.2011
  • 6卜磊,解定宝.混成系统形式化验证[J].软件学报,2014,25(2):219-233. 被引量:16
  • 7Yanhong HUANG,Jifeng HE,Huibiao ZHU,Yongxin ZHAO,Jianqi SHI,Shengchao QIN.Semantic theories of programs with nested interrupts[J].Frontiers of Computer Science,2015,9(3):331-345. 被引量:1

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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