Timing assumptions and verification of finite-state concurrent systems
Proceedings of the international workshop on Automatic verification methods for finite state systems
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Theoretical Computer Science
Fundamentals of algorithmics
Generating test cases for real-time systems from logic specifications
ACM Transactions on Computer Systems (TOCS)
Theoretical Computer Science
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Generating Test Cases for a Timed I/O Automaton Model
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
An Approach for Testing Real Time Protocol Entities
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Test Generation in the Presence of Conflicting Timers
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Time Abstracted Bisimiulation: Implicit Specifications and Decidability
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
A new method for testing real time systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Automatic generation of tests for timing constraints from requirements
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Timing Constraints of Real-Time Systems: Constructs for Expressing Them, Methods of Validating Them
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
Real-time applications are those reactive systems whose behavior depends not only on their interactions with the environment but also on the times at which these interactions take place. The timing aspect of such applications makes it hard to test them exhaustively because of the infinite number of possible computations. One way to deal with this difficulty is to have the tester choose some important features of the application and check if they are properly implemented. This paper follows this principle and proposes a method for testing real-time applications formally modeled as Timed Input Output Automata (TIOA), a variant of Timed Automata of Alur and Dill (Theor. Comp. Sci. 1994; 126:183–235). The method is based on test purposes. A test purpose is a description of a well-defined testing objective focusing on a single requirement or a set of requirements of the system under test. Test purposes, in this paper, are used to describe the features of the application to be checked by the tester. They are also formally modeled, in this paper, as a TIOA. Since test purposes are a partial behavior of the application under test, they significantly help to reduce the number of test cases to be generated, and consequently minimize the time, effort, and money to spend in testing the application. Basically, the paper proposes an approach, which takes as inputs a test purpose and a specification, and generates test cases, which are able to check if the test purpose is satisfied by an implementation of the specification. The proposed method consists of three main steps. First, the TIOAs of the specification and test purpose are combined together in one TIOA. Second, the resulting TIOA is sampled to construct a sub-automaton of the system with a finite number of executions for test generation. The sampling of a TIOA is done based on the number of clocks describing the timing behavior of the system. Finally, the sub-automaton resulting from the second step is traversed to generate test cases. The real-time applications dealt with in this paper are supposed to be deterministic; i.e. the test results are the same when the same input data are applied to the implementation of the application. Copyright © 2011 John Wiley & Sons, Ltd.