The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Testing methods aiming to demonstrate that an implementation behaves the same as a specification X-machine (extended finite-state machine) usually assume that (1) all states are terminal states and (2) there are no priorities associated with operations on transitions. The considered model for the machine is such that outputs for transitions leading to non-terminal states will be buffered and contents...
By deeply studying the E-LOTOS standard and the XML language, this paper has analyzed the E-LOTOS text that is used to describe the protocol running mechanism, and has designed the structure of XML that is preserve the abstract test case, the file class supported by JAVA is used to parse the E-LOTOS text, and the adjacency FSM(finite state machine) is obtained meanwhile the FSM`s graph is drawn. Based...
Finite state automata are widely used in specification-based testing. However, the existing specification- based testing techniques do not fully automate the generation of an FSM from a formal specification. Major challenges in automatic generation of FSM are the identification of disjoint states and transitions from the implicit pre- and postconditions of operations specified in a formal language...
Finite State Machines (FSMs) are widely used to generate test case suites for critical systems. Several test case generation methods are derived from the well-known W-method. The Wp-method is a variation of the W-method, which produces smaller test suites. The G-method is a generalization of the W-method, which dispenses the use of characterization sets. In this paper, we combine ideas of both, and...
This paper presents an automatic conformance testing tool with timing constraints from a formal specification (TEFSM: Timed Extended Finite State Machine) of web services composition (WSOTF: Web Service composition, Online Testing Framework), that is implemented by an online testing algorithm. This algorithm combines simultaneously idea of test execution and debug to generate and simultaneously execute...
In this paper we consider test suite derivation for nondeterministic Finite State Machines (FSM) w. r. t. the non-separability relation. The improvement to the existing algorithms is proposed for exhaustive test derivation without the explicit enumeration of all possible implementations. One algorithm can be applied when the set of possible implementations is the set of all complete nondeterministic...
This work proposes an on-the-fly testing approach for Web applications based on automaton theory. Web applications and test directives which are used to select test cases are modeled by FSM (Finite State Machine). Synchronous product is used to combine these two kinds of FSMs in order to check whether the SUT (System Under Test) includes the behavior expressed by the test directive. Test cases are...
Formal models are often considered for software systems specification, and are helpful for verifying that certain properties are respected, or for automatically generating the implementation code corresponding to the model, or again for conformance testing, for the automatic generation of test cases to check an implementation against the formal specification. Variations of finite state machine (FSM)...
The need for automatic testing of large-scale Web applications suggests the use of model-based testing technology. Among various modeling languages, UML is widely spread and used for its simplicity, understandability and ease of use. But rigorous analysis for UML model is difficult due to its lack of precise semantics. On the other hand, as a formal notation, FSM provides an avenue for automatic generation...
Software systems are used widely in many applications where a bug in the system can cause large damage. To prove the correctness of the software system by finding the bugs is the most important and the most difficult task. In this paper, we review and discuss the current approaches for software analysis mainly on model checking and testing. Model checking is a proven successful technology but it works...
In this paper we present a new model to formally represent complex information systems. This new formalism is very suitable to specify time requirements (both time consumption due to the performance of tasks and timeouts) as well as to represent data communication among different components of a system. In addition to provide the theoretical framework, we show how this formalism, based on finite state...
Automated test case generation from behavioral models like finite state machines (FSMs) and statecharts has long been studied. Environments that enable a test designer to model a real complex software and to obtain test cases to validate such a software are mandatory in an automated test approach. This paper presents an environment, GTSC, which enables test sequences to be obtained from both Statechart-based...
Task trees are common notations used to describe the interaction between a user and an interactive application. Thus, they contain valuable information about the expected user behaviour. In this paper, we present a method for automatically generating test data from a task tree. The task tree is extended to support operational profile specification. The user behaviour is automatically extracted as...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.