期刊文献+

基于LTS图的构件规约匹配

LTS graph-based component specification matching
下载PDF
导出
摘要 构件重用是缩减软件设计周期和提高软件可靠性的有效方法。基于构件的软件开发(CBSD)主要花费在于构件的检索和修改,而匹配过程则是关键。文章提出一个基于LTS图模型(Labeled Transition System)的形式化构件匹配方法,此方法将构件匹配分为结构匹配和功能匹配两部份。结构匹配过程通过树的同构匹配完成,用于检查构件的可调整性;功能匹配则通过S-Forced模拟完成,用于确保得到适当的功能。 Component reuse is an effective way to reduce software design cycle and to improve software reliability. Component based software development( CSBD)'s major task is the retrival and iraprovement of components, the key to which is matching. A formal method of component matching based on LTS graph model was developed, in structure matching and functionality matching. which the component matching was divided into tree The tree structure matching was implemented by tree isomorphic matching, whereas functionality matching was realized by S-forced simulation. The structural matching was used to check the adaptability of components while the functional matching was to ensure functionality.
作者 林雪云
出处 《福建工程学院学报》 CAS 2009年第6期672-676,共5页 Journal of Fujian University of Technology
关键词 LTS LTStree LTSforest S-forcedsimulation LTSgraphmatching labelled transition system(LTS) LTS-tree LTS-forest S-forced simulation LTS-graph matching
  • 相关文献

参考文献2

二级参考文献8

  • 1S Torshen, F Naumann. Approximate tree embedding for querying XML data. ACM SIGIR 2000 Workshop on XML and Information Retrieval, Athen, Greece, 2000
  • 2Dennis Shasha, Jason T L Wang. ATreeGrep: Approximate search in unordered trees. The 14th Int'l Conf on Science and Statistical Database Management, Edinburgh, Scotland, 2002
  • 3D Shasha, J Tsong, L Wang. Exact and approximate algorithm for unordered tree matching. IEEE Trans on Systems, Man and Cybernetics, 1994, 24(4): 668~678
  • 4K Z Zhang, R Statman, D Shasha. On the editing distance between unordered labeled trees. Information Processing Letters,1992, 42(3): 133~139
  • 5Pascal Ferraro, Christophe Godin. An edit distance between quotiented trees. Algorithmic a, 2003, 36(1): 1~39
  • 6R Thorsten. A new measure of the distance between ordered trees and its applications. Department of Computer Science, University of Bonn, Tech Rep. 85166, 1997
  • 7常继传,李克勤,郭立峰,梅宏,杨芙清.青鸟系统中可复用软件构件的表示与查询[J].电子学报,2000,28(8):20-23. 被引量:80
  • 8王渊峰,薛云皎,张涌,朱三元,钱乐秋.刻面分类构件的匹配模型[J].软件学报,2003,14(3):401-408. 被引量:47

共引文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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