共查询到20条相似文献，搜索用时 0 毫秒
1.
Natalia Spitsyna Khaled El‐Fakih Nina Yevtushenko 《Software Testing, Verification and Reliability》2007,17(4):227-241
Several authors have studied the relationships between non‐deterministic finite state machines (FSMs). These relationships can be used, for example, for deriving conformance tests from specifications represented by FSMs. In this paper, the separability relation between FSMs is studied. In particular, an algorithm is presented that derives a shortest separating sequence of two non‐deterministic FSMs. Given FSMs S with n states and T with m states, it is shown that the upper bound on the length of a shortest separating sequence is 2mn−1. Moreover, the upper bound is shown to be reachable. However, according to the conducted experiments, on average, the length of a shortest separating sequence of FSMs S and T states is less than mn and the existence of a separating sequence significantly depends on the number of non‐deterministic transitions in these FSMs. The proposed algorithm can also be used for deriving a separating sequence of two different states of a single FSM or for deriving a separating sequence of three or more FSMs. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
2.
Luo Gang 《计算机科学技术学报》1994,9(4):289-301
We present a method of generating test cases from the software specifications which are modeled by nondeterministic finite state machines.It is applicable to both nondeterministic and deterministic finite state machines.When applied to deterministic machines,this method yields usually smaller test suites with full fault coverage than the existing methods that also assure full fault coverage.In particular,the proposed method can be used to test the control portion of software specified in the formal specification languages SDL or ESTELLE. 相似文献
3.
应用第一原理的故障诊断思想,基于故障测试矩阵,提出了一种根据系统每一个故障都可检测的行为与系统所有故障不能检测的行为之间的不相容推理技术,来判断和求取系统存在的所有最小完全测试集的方法。方法分两步：一是根据系统的结构和测试矢量等知识,结合故障测试矩阵,识别冲突集候选;二是根据冲突集候选,确定最小命中集合组,生成最小完全测试集。该方法可有效求解最小完全测试集,减少测试矢量施加的工作量,提高故障诊断的效率。 相似文献
4.
Finite State Machines (FSMs) are widely used for verification and testing of many reactive systems and many methods are proposed for generating tests from FSMs with the guaranteed fault coverage. However, some systems can only be properly described when time constraints are considered, advocating the adoption of models with the notion of time. In this paper, a method for deriving conformance tests with the guaranteed fault coverage from a Timed FSM (TFSM) with a single clock is presented. Test derivation is based on a given fault domain that allows the derivation of test suites with reasonable length. More precisely, the fault domain includes every possible faulty TFSM implementation with the known largest time constraints boundaries and minimal duration of time guards. Given a deterministic possibly partial TFSM specification, a complete test suite that guarantees the detection of all faulty implementations with respect to the above fault domain is derived. Experiments with randomly generated timed FSMs are conducted to determine length of obtained test suites and assess the impact of varying the TFSM specification parameters on length of obtained test suites. Further, experiments with both untimed and timed machines are conducted and these experiments show that similar patterns for timed and untimed machines are obtained with respect to varying the number of states, inputs, and outputs of machines. 相似文献
5.
Vanya Yaneva Ajitha Rajan Christophe Dubach 《Software Testing, Verification and Reliability》2022,32(1):e1796
Model-based development is a popular development approach in which software is implemented and verified based on a model of the required system. Finite state machines (FSMs) are widely used as models for systems in several domains. Validating that a model accurately represents the required behaviour involves the generation and execution of a large number of input sequences, which is often an expensive and time-consuming process. In this paper, we speed up the execution of input sequences for FSM validation, by leveraging the high degree of parallelism of modern graphics processing units (GPUs) for the automatic execution of FSM input sequences in parallel on the GPU threads. We expand our existing work by providing techniques that improve the performance and scalability of this approach. We conduct extensive empirical evaluation using 15 large FSMs from the networking domain and measure GPU speed-up over a 16-core CPU, taking into account total GPU time, which includes both data transfer and kernel execution time. We found that GPUs execute FSM input sequences up to 9.28× faster than a 16-core CPU, with an average speed-up of 4.53× across all subjects. Our optimizations achieve an average improvement over existing work of 58.95% for speed-up and scalability to large FSMs with over 2K states and 500K transitions. We also found that techniques aimed at reducing the number of required input sequences for large FSMs with high density were ineffective when applied to all-transition pair coverage, thus emphasizing the need for approaches like ours that speed up input execution. 相似文献
6.
7.
基于UIO序列的测试方法及UIO生成算法研究 总被引：1，自引：4，他引：1
测试序列生成是协议一致性测试的一个重要方面,好的测试序列应该有较大的错误覆盖率且长度越短越好。测试序列构成中的第三部分通常称为状态识别序列,通过比较几种以UIO序列为状态识别序列的协议一致性测试方法,提出了一个更好的UIO序列生成算法,该算法能产生更短的UIO序列。 相似文献
8.
基于粗糙集和支持向量机的机械故障诊断系统 总被引：4，自引：0，他引：4
提出了一种基于粗糙集和支持向量机(SVM)的机械故障诊断系统：首先将故障诊断决策系统中的连续属性值离散化；再基于粗糙集理论计算决策系统的约简，根据实际需要确定最优决策系统；最后在最优决策系统基础上设计SVM多分类器进行故障诊断。4135柴油机的实际故障诊断结果验证了所提出的粗糙集理论与SVM相结合的故障诊断系统的可行性。 相似文献
9.
10.
11.
12.
We advocate a fusion of property-oriented testing (POT) and model-based testing (MBT). The existence of a symbolic finite state machine (SFSM) model fulfilling the properties of interest is exploited for property-directed test data generation and to create a test oracle. A new test generation strategy is presented for verifying that the system under test (SUT) satisfies the same LTL safety conditions over a given set of atomic propositions as the model. We prove that this strategy is exhaustive in the sense that any SUT violating at least one of these formulae will fail at least one test case of the generated suite. It is shown that the existence of a model allows for significantly smaller exhaustive test suites as would be necessary for POT without reference models. As a corollary, the main theorem also generalises a known result about SFSM-based conformance testing for language equivalence. Our approach fits well to industrial development processes for (potentially safety-critical) cyber-physical systems, where both models and properties representing system requirements are elaborated for development, verification, and validation. 相似文献
13.
14.
一类水力发电机组在线状态监测系统的设计 总被引：1，自引：0，他引：1
小波分析具有良好的时频分析特性,将小波分析技术运用于机械振动信号的分析处理中能较好的识别机械运行状态,弥补传统分析方法的不足,实现机械状态监测。针对一类水力发电机组设计了一套状态监测和故障诊断系统,并通过实例验证了系统的可行性和适用性。 相似文献
15.
一致性测试的目的是测试疲则系统（或实现）是否符合有关标准，多方测试的应用领域是协议步及到多于两方的场合，本文开放系统互连多方测试的一般方法。 相似文献
16.
基于标号变迁系统的测试集自动生成 总被引：3，自引：0，他引：3
首先,依据ISO89646的定义,阐述了协议一致性测试的基本概念,然后,介绍标号变迁系统（LTS）的形式化理论的定义和基本性质,利用LTS,给出测试例、测试集以及测试生成的形式化定义,第3,表述了实现关系在测试生成中的地位和作用,定义了输入输出系统,并在输入输出系统以及△变换的基础上引入实现关系ioco,根据实现关系ioco给出了一个测试集自动生成算法,该算法能很好地适用于递归的LTS。 相似文献
17.
Leonard Gallagher Jeff Offutt Anthony Cincotta 《Software Testing, Verification and Reliability》2006,16(4):215-266
In object‐oriented terms, one of the goals of integration testing is to ensure that messages from objects in one class or component are sent and received in the proper order and have the intended effect on the state of the objects that receive the messages. This research extends an existing single‐class testing technique to integration testing of multiple classes. The single‐class technique models the behaviour of a single class as a finite state machine, transforms the representation into a data flow graph that explicitly identifies the definitions and uses of each state variable of the class, and then applies conventional data flow testing to produce test case specifications that can be used to test the class. This paper extends those ideas to inter‐class testing by developing flow graphs, finding paths between pairs of definitions and uses, detecting some infeasible paths and automatically generating tests for an arbitrary number of classes and components. It introduces flexible representations for message sending and receiving among objects and allows concurrency among any or all classes and components. Data flow graphs are stored in a relational database and database queries are used to gather def‐use information. This approach is conceptually simple, mathematically precise, quite powerful and general enough to be used for traditional data flow analysis. This testing approach relies on finite state machines, database modelling and processing techniques and algorithms for analysis and traversal of directed graphs. The paper presents empirical results of the approach applied to an automotive system. This work was prepared by U.S. Government employees as part of their official duties and is, therefore, a work of the U.S. Government and not subject to copyright. Published in 2006 by John Wiley & Sons, Ltd. 相似文献
18.
Specification-based Testing for Gui-based Applications 总被引：1，自引：0，他引：1
The development of GUI-based applications has raised a lot of new issues, one of them being how to automate effective testing for applications with complicated graphical user interactions. In this paper, we discuss the architectural issues and the implementation concerns of our approach to an automated specification-based testing technique for GUI-based applications. This approach is carried out by enriching existing architecture for automated specification-based testing. An essential part of our work is a visual environment to obtain test specifications. This environment pre-runs the Application Under Test (AUT) under its own control, with two prominent characteristics: First, testers can edit test specifications within the true GUI environment of the AUT. Second, the recorded input and output contain the same references as those in the AUT, so that the test cases generated from the edited specification can be used directly by test oracles during the automated testing procedure.We present our running prototype of a visual specification editor that allows users to graphically manipulate test specifications when these specifications are given in term of Finite State Machines (FSM) and the implementations of the AUT are GUI-based Java applications. 相似文献
19.