共查询到20条相似文献,搜索用时 125 毫秒
1.
RED图可以表示一个完整的时间自动机上的状态集,包括其连续时间部分和离散部分.在它基础上实现的模型检测工具RED,在时间自动机模型检测中表现出了优良的性能.另一方面,现有的概率时间自动机模型检测工具仍然使用不同的方法来分别表示概率时间自动机状态的连续时间和离散部分.我们在复用原始RED图的数据结构的基础上,对其做出了扩展,以令其支持概率状态的表达,同时保持其性能方面的优势.我们又为此实现了一个概率时间自动机可达性分析工具原型,并将其与两个概率模型检测工具(PRISM和Modest)就概率时间自动机可达性分析作实验对比,来评估该工具原型的性能.实验结果显示,我们的集成表示概率状态空间的方式,确实提高了概率时间自动机模型检测的时间效率和延展性. 相似文献
2.
3.
4.
5.
提出了一种基于有限状态自动机的Web服务自动组合方法,该方法能够自动实现BPEL中抽象业务流程与Web服务的绑定.以有限状态自动机模型形式化地定义了业务流程的外模式和内模式,将Web服务组合问题转化为有限状态自动机问题.利用有限状态自动机的笛卡儿积运算,得出了服务组合系统的行为描述.在此基础上,提出了组合服务存在性的判定依据,进一步给出了组合服务的计算方法,设计并实现了一个演示系统. 相似文献
6.
可用性评估是保证界面质量的重要手段。利用粗糙集灰色分析解决复杂产品界面可用性评估中的模糊问题,建立界面可用性评估模型;基于任务将难以直接评估的复杂界面分解成多个子界面,建立新的复杂界面可用性评价指标的测量方法和实验范式,从而实现对复杂界面可用性的客观评价。经实例验证,本方法可实现对多个复杂界面方案进行可用性评估和优选,最后通过脑电实验验证了其有效性。 相似文献
7.
基于Visual C#语言实现了有限状态自动机.该自动机具有小巧轻便、简单易用的优点,可应用于程序复杂界面的操作与控制. 相似文献
8.
基于子集构造法的优化的NFA确定化算法 总被引:1,自引:0,他引:1
使用子集构造法对非确定有限自动机进行确定化的过程中存在大量重复计算的问题.为解决此问题,基于非确定有限自动机的特点并针对子集构造法的不足,提出了一种优化的非确定有限自动机确定化算法.首先定义了识别符的有效引出状态集概念并证明了ε-closure的并定理以保证算法的正确性,其次给出了用于避免重复计算的识别符的有效引出状态集的构造子算法和单状态集的ε-closure的求算子算法,基于这两个子算法给出了优化的非确定有限自动机确定化算法,最后将算法应用于实例,实验结果表明计算量远小于子集构造法的计算量.相比子集构造法,算法能更有效地对非确定有限自动机进行确定化. 相似文献
9.
基于场景的联锁软件形式化模型生成方法 总被引:1,自引:0,他引:1
为保证列车运行安全和旅客生命财产安全,对车站联锁控制系统进行有效的分析、验证和测试是必不可少的,而形式化模型是联锁系统分析、验证和测试的基础.以计算机联锁软件的UML半形式化模型为基础,以事件确定有限自动机模型作为描述系统的形式化模型,研究UML2.0顺序图转换为事件确定有限自动机模型的方法.首先选取一组与交互行为相关的全局变量作为状态向量来分析和消解顺序图各个场景的消息以及不同场景间的同一消息的前后置状态向量值是否存在矛盾,从而得到一致性的需求场景;然后提取各对象的事件序列生成对应的事件确定有限自动机;最后通过组合系统中对象的自动机模型得到系统的事件确定有限自动机模型.该方法改善了安全苛求软件的设计与开发,为软件质量评估提供了技术支撑. 相似文献
10.
11.
界面流是一组窗体的集合,它表示了窗体之间的关系.有限状态机是交互式系统设计分析中的一种数学模型,能够有效地表示一个动态系统的生存周期.由于界面流逻辑的复杂性,提出采用有限状态机进行描述.阐述了有限状态机的基本理论,并依据界面流的特点,对其进行了改进,增加了动作参数和窗体迁移的条件参数,丰富了有限状态机描述界面流的能力,最后给出了运用面向对象方法的有限状态机设计. 相似文献
12.
13.
In this paper, we propose a method to test a probabilistic FSM. The testing process consists of two parts. First, we check if there are any output faults or transfer faults in transitions. In order to identify a state of a PFSM, the characterization set is extended such that states are identified not only by observing output sequences but also by comparing probabilities. Second, we test whether the transition probabilities are correctly implemented. Interval estimation is used to assert the correctness of transition probabilities where a test verdict is assigned with a given confidence level. From a given confidence level and confidence interval length, a method is presented to determine the test sequence repetition numbers for testing probabilities. Fault coverage evaluation is carried out based on extended fault types where probabilities are changed. As an application, we apply the proposed method to a probabilistic non-repudiation protocol. 相似文献
14.
A heuristic method for encoding internal states (state assignment) of finite state machines (FSMs) so as to reduce their power consumption is proposed. A feature of the proposed approach is that the state assignment procedure takes into account the activity function of the memory elements when the FSM transits from a current state to other states that have already been encoded. A procedure for determining the power consumption of the FSM based on the codes of its internal states and probabilities of appearance of units at each input of the FSM is described. Experiments showed that the proposed approach makes it possible to reduce the power consumption of the FSM by 39% on the average compared with the NOVA algorithm and sometimes by 68%. In conclusion, the possibilities of improving the performance of the proposed algorithm in the synthesis of a specific FSM are discussed and promising directions of further research are indicated. 相似文献
15.
16.
17.
随着设计系统结构的日益复杂,选择合理的设计方法与结构已成为软件设计中的关键技术。目前,在软件设计领域,有限状态机(FSM)的理论俨然已自成一体,经常用来描述一些复杂的算法,表明算法内部的状态结构,关注对象的执行顺序等。据此,本文以EDA和PLC这两种不同的支持平台为载体,对有限状态机方法的结构体系及应用进行研究。结果表明,FSM方法将控制过程分成有限个稳定状态,描述对象所经历的状态序列与转移,从而解决电子领域中诸多控制问题。且在不同的应用平台上,FSM方法的核心要素不变。 相似文献
18.
This article proposes two modifications of the microcommand addressing system in a compositional microprogram control unit with code sharing. The modifications are based on using FSM pseudoequivalent states to reduce the number of rows in the FSM transition table and thereby to reduce the complexity of the combinational part of the device. Methods are proposed for synthesizing compositional control units with a modified microcommand addressing system. The research results are presented and appropriate fields of application of the methods proposed are considered. 相似文献
19.
Gerard J. Holzmann 《Software》1988,18(2):137-161
20.
A. S. Klimovich V. V. Solov’ev 《Journal of Computer and Systems Sciences International》2011,50(6):907-920
The problem of minimization of Moore finite-state machines (FSMs) is considered. This problem often arises in designing digital
devices based on programmable logic devices. The proposed approach uses the operation of merging of two states of an FSM and
the representation of the FSM as a list of transitions. Conditions guaranteeing the identical operation and deterministic
behavior of the transformed FSM obtained by merging two states are given. The cases when wait states can emerge are also discussed.
Algorithms for minimizing the number of internal states, transition paths, and the number input variables of Moore FSMs are
described. Experimental results have shown that the proposed approach reduces the number of internal states by 6% on the average
and sometimes by a factor of 1.86; the number of transitions is reduced by 20% on the average and sometimes by a factor of
2.83. The use of the proposed method in combination with the STAMINA computer program reduces the number of internal states
by 16% on the average and sometimes by a factor of 2.17; the number of transitions is reduced by 41% on the average and sometimes
by a factor of 7.97. In conclusion, important directions of research concerning the minimization of FSMs are discussed. 相似文献