共查询到20条相似文献,搜索用时 0 毫秒
1.
针对良序结构迁移系统可覆盖性分析计算成本高的问题,提出一种运用有限状态模型检验技术解决无穷状态系统可覆盖性问题的算法.首先将良序结构迁移系统划分为不同权值限定下的一系列有限状态机模型;然后采用最新的模型检验技术增量式地计算不同权值下模型的可达状态空间上逼近,得到可覆盖的反例路径或证明该系统不可覆盖.实验结果表明,该算法在同等计算时间限制下能够解决更多的测试样例;在1 GB内存限制下,可以解决97.2%的测试样例,超过同类算法的2倍. 相似文献
2.
In this paper we present a new framework for computing the backward reachability from an upward-closed set in a class of parameterized (i.e. infinite state) systems that includes broadcast protocols and petri nets. In contrast to the standard approach, which performs a single least fixpoint computation, we consecutively compute the finite state least fixpoint for constituents of increasing size, which allows us to employ binary decision diagram (BDD)-based symbolic model checking. In support of this framework, we prove necessary and sufficient conditions for convergence and intersection with the initial states, and provide an algorithm that uses BDDs as the underlying data structure. We give experimental results that demonstrate the existence of a petri net for which our algorithm is an order of magnitude faster than the standard approach, and speculate properties that might suggest which approach to apply. 相似文献
3.
一种基于层次距离计算的聚类算法 总被引:6,自引:0,他引:6
针对广泛存在的层次编码型数据类型,提出了层次距离的新概念,证明了相关的数学性质,并在此基础上提出并实现了新的基于层次距离计算的聚类算法HDCA(Hierarchy Distance Computing based clustering Algorithm).新方法克服了传统聚类算法标称型计算的缺陷,提高了聚类精度.针对聚类算法的中心点问题,提出了相应的层次编码型数据的快速处理算法,并从理论上证明了算法的正确性.实验表明,对比朴素处理算法,HDCA的性能明显提高.新算法已经应用到警用流动人口分析当中,取得了良好效果. 相似文献
4.
M. Lamnabhi 《Systems & Control Letters》1982,2(3):154-162
We present a new operational calculus for computing the response of nonlinear systems to various deterministic excitations. The use of a new tool: noncommutative generating power series, allows us to derive, by simple algebraic manipulations, the Volterra functional series of the solution of a large class of nonlinear forced differential equations. The symbolic calculus introduced appears as a natural generalization to the nonlinear domain, of the well known Heaviside operational calculus. Moreover, this method has the advantage of allowing the use of a computer. 相似文献
5.
We propose a general methodology for analysing the behaviour of open systems modelled as coordinators, i.e., open terms of suitable process calculi. A coordinator is understood as a process with holes or placeholders where other coordinators and components (i.e., closed terms) can be plugged in, thus influencing its behaviour. The operational semantics of coordinators is given by means of a symbolic transition system, where states are coordinators and transitions are labeled by spatial/modal formulae expressing the potential interaction that plugged components may enable. Behavioural equivalences for coordinators, like strong and weak bisimilarities, can be straightforwardly defined over such a transition system. Different from other approaches based on universal closures, i.e., where two coordinators are considered equivalent when all their closed instances are equivalent, our semantics preserves the openness of the system during its evolution, thus allowing dynamic instantiation to be accounted for in the semantics. To further support the adequacy of the construction, we show that our symbolic equivalences provide correct approximations of their universally closed counterparts, coinciding with them over closed components. For process calculi in suitable formats, we show how tractable symbolic semantics can be defined constructively using unification. 相似文献
6.
7.
During the past four years, the authors have developed the Synchronizing Transition Set (STS) approach to solve protocol conversion problems for interconnecting heterogeneous computer networks. The STS approach is a 5-step formal algorithm: given service specifications of target protocols as its input, it derives a protocol converter specification as output. Several variations of the STS algorithm have been studied, and it was formally proven that all of these variations support the same correctness properties [1–4], such as conformity, liveness and transparency properties. Recently, the STS algorithm has been fully implemented in an STS protocol converter generation package. The package is written in the C language under a standard UNIX operating system. It needs less than 1000 lines of C statements to fully implement the STS algorithm. Moreover, to generate a converter between some classical example protocols, such as ABP (alternating bit protocol) and go-back-n protocols, it only takes a few seconds to derive a correct protocol converter specification using a desktop workstation. In this paper, the STS algorithm and its implementation are presented. 相似文献
8.
9.
10.
fKenzo (=friendly Kenzo) is a graphical user interface providing a user-friendly front-end for the Kenzo system, a Common Lisp program devoted to Algebraic Topology. The fKenzo system provides the user interface itself, an XML intermediary generator-translator and, finally the Kenzo kernel. We describe in this paper the main points of fKenzo, and we explain also the advantages and limitations of fKenzo with respect to Kenzo itself. The text is separated into two parts, trying to cover both the user and the developer perspectives. 相似文献
11.
视觉词典容量是影响图像场景分类精度的重要因素之一,大容量的视觉词典因计算量较大影响了分类的效率,而小容量的视觉词典由于多义词问题的严重致使场景分类精度降低.针对该问题,提出一种基于概念格层次分析的视觉词典生成方法.首先生成关于训练图像视觉词包模型的初始视觉词典;然后在构造的概念格上利用概念格的概念层次性,通过动态地调整外延数阈值,获取粒度大小不同容量的描述图像各场景语义的约简视觉词典;最后对各类约简视觉单词构成向量进行异或,删除多义词,进而生成有效描述图像场景语义的视觉词典.实验结果表明,文中方法是有效的. 相似文献
12.
Sébastien Bardin Alain Finkel Jérôme Leroux Laure Petrucci 《International Journal on Software Tools for Technology Transfer (STTT)》2008,10(5):401-424
Fast acceleration of symbolic transition systems (Fast) is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing
the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative
techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture
choices. Finally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated.
This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005. 相似文献
13.
本文运用层次分析法对后方仓库的库房选择决策进行了研究,建立了库房选择决策模型,有效减少了人的主观因素给仓库工作带来的负面影响,提高了库房的利用效率. 相似文献
14.
层次分析法在目标主机安全量化融合中的应用 总被引:8,自引:1,他引:7
在计算机网络安全领域,针对目标主机的安全性能分析评估是当前的研究热点。该文从分析影响目标主机安全性能的因素入手,运用层次分析法,确定安全评价指标,构建目标主机安全性能评价层次结构模型,为评价目标主机的安全性能提供了可行的方法。 相似文献
15.
文章提出一种移动IP中移动代理功能分层的设计方案。该方案使用了和RFC2002基本协议兼容的消息扩展格式。使得快速转移能力和扩展能力有了提高。私有地址在外地分层代理可以使用,并且不需要向移动接点说明这种分层结构的外地代理。 相似文献
16.
A symbolic approach for content-based information filtering 总被引:2,自引:0,他引:2
Byron L.D. Bezerra 《Information Processing Letters》2004,92(1):45-52
17.
测试用例的生成是软件测试的关键和难点所在。基于UML状态图的测试是近年来研究的热点。本文根据UML状态图的层次结构,提出了对UML状态图分层产生测试用例的测试用例生成方法。对迁移关系冲突而导致测试无法正确执行的情况,给出了插入测试子序列来避免迁移冲突的测试方法。 相似文献
18.
尝试将层次分析和灰色关联分析相融合对产品满意度构建指标、顾客、产品三维层次评价模型,该模型不仅能优化各指标的权重值,还能提高产品满意度评价结果的精度。将三维层次评价方法应用到景德镇陶瓷产品满意度评价中,对陶瓷产品的品牌、外形、质量、价格、功能、服务6项指标进行考核,实例评价结果说明该方法具有较好的科学性和实用性。 相似文献
19.
TBSN:一种基于分类层次的P2P网络 总被引:1,自引:0,他引:1
构建语义覆盖网络是支持基于语义的搜索、提高P2P网络查找性能和可扩展性的重要手段.现有的基于分类层次的P2P语义覆盖网络并不能充分利用分类层次所包含的语义信息,为此提出了一种基于分类层次的P2P网络(TBSN),该网络充分考虑遵循某种分类层次的数据源的特点,能够利用分类层次所包含的语义信息,动态地将peer节点聚簇成不同的语义簇,语义簇之间根据语义关系建立相应的语义路由,从而形成了一种基于语义的P2P网络.每个语义簇由一个super-peer节点和多个peer节点组成,仅负责回答其语义子空间上的查询.查询根据语义首先被路由到可能有结果的语义簇中,然后转发给相关的peer节点,从而减少查询所涉及的节点和消息的数量,提高了网络的性能.实验表明,TBSN网络在查找性能和开销之间取得了良好的平衡,同时较好地保持了语义簇之间的负载平衡和簇中数据之间的语义关系. 相似文献
20.
层次信息可视化技术研究综述 总被引:6,自引:0,他引:6
随着掌控的层次信息在数量和规模上的急剧增长,用户迫切需要高效的可视化工具在理解信息和制定决策过程中对认知行为进行辅助.首先对层次结构进行介绍,给出层次可视化的设计目标;然后讨论了层次可视化技术的分类问题,并尝试提出一种较为合理且便于阐述的表现-维度分类框架;随后基于上述分类框架,重点分析现有主要层次可视化技术的基本原理和特征;最后比较总结各类技术,并对层次可视化可能的研究方向及面临的挑战做出展望. 相似文献