An Approach for Testing Real Time Protocol Entities

Khoumsi, Ahmed; Akalay, Mehdi; Dssouli, Rachida; En‐Nouaary, Abdeslam; Granger, Louis

doi:10.1007/978-0-387-35516-0_18

Cited by 18 publications

(22 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As an example, a TA [1] is obtained from a finite state automaton (FSA) by annotating every transition of the FSA by a timing constraint and by clock(s) to reset. Few work has been done for testing timed systems, for example [4,5,6,7,8,9,10,11,11,12,13,14]. For lack of space, let us introduce only the methods in [8,9,10,11] because they use the same approach as us, that is, they are inspired by test methods for untimed systems.…”

Section: Testing Timed Systemsmentioning

confidence: 99%

“…They do not reduce the state explosion problem but, contrary to [8], the exact instants of outputs remain unknown, only the respect or the violation of time constraints is important. -The authors of [10] propose a method which reduces the state explosion problem induced by the methods of [8,9]. An important limitation of this method is that it is applicable only when a single clock is used to describe all the timing constraints of the specification.…”

Section: Testing Timed Systemsmentioning

confidence: 99%

“…An important limitation of this method is that it is applicable only when a single clock is used to describe all the timing constraints of the specification. -The authors of [11] remove the single-clock limitation of [10], but they create another limitation by assuming that in the TA which describes the specification, the set of possible values of clocks in a location does not depend on the path which has been executed to reach this location.…”

Section: Testing Timed Systemsmentioning

confidence: 99%

“…Actually, such a procedure is quite complex because it is applicable to the general case where several clocks are used [15]. A simpler version, which is applicable when a single clock is used, is presented in [10]. Let us consider the example of -the reset "c 1 := 0" in tr 1 is replaced by Set(c 1 , 3 ) because it is used to express the timing constraint "c 1 ≤ 3" in tr 2 ; -the reset "c 2 := 0" in tr 1 is replaced by Set(c 2 , 2 ) because it is used to express the timing constraints "c 2 < 2" and "c 2 ≥ 2", in tr 3 and tr 4 respectively; -the reset "c 1 := 0" in tr 2 is replaced by Set(c 1 , 1 ) because it is used to express the timing constraint "c 1 ≥ 1" in tr 3 and tr 4 .…”

Section: A Few Details About the Construction Of Set And Expmentioning

confidence: 99%

“…The test method in [10] is applicable iff a single clock is used. Our method generalizes the method of [10] by being applicable when one or several clocks are used. 3.…”

Section: Contributionsmentioning

confidence: 99%

See 4 more Smart Citations

A Method for Testing the Conformance of Real Time Systems

Khoumsi

2002

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The aim of conformance testing is to check whether an implementation conforms to a specification. We consider the case where the specification contains timing constraints and is described by a model called Timed Automata (TA). The state space of a TA can be infinite due to the infinite number of time values. In a recent work, we proposed a method to finitely represent the state space. The proposed method transforms a TA into an equivalent finite state automaton using two special types of events, Set and Exp, and denoted se-FSA. In the present article, we propose a conformance testing method which is applicable when the specification is described by a TA. First, we use the above-mentioned transformation procedure for representing the specification by a se-FSA. Second, we propose a procedure for generating test sequences from the se-FSA describing the specification. And third, we propose a simple architecture for executing the generated test sequences.

show abstract

Section: Testing Timed Systemsmentioning

confidence: 99%

Section: Testing Timed Systemsmentioning

confidence: 99%

Section: Testing Timed Systemsmentioning

confidence: 99%

Section: A Few Details About the Construction Of Set And Expmentioning

confidence: 99%

“…The test method in [10] is applicable iff a single clock is used. Our method generalizes the method of [10] by being applicable when one or several clocks are used. 3.…”

Section: Contributionsmentioning

confidence: 99%

See 3 more Smart Citations

A Method for Testing the Conformance of Real Time Systems

Khoumsi

2002

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

A test purpose‐based approach for testing timed input output automata

En‐Nouaary

2011

Software Testing Verif & Rel

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Fault Detection of Hierarchical Networks with Probabilistic Testing Algorithms

Li¹,

Lee

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

As communications networks are expanding to larger areas the control and maintenance of routing information are becoming a formidable task. To cope with its size and complexity and to make the network reliable and scalable hierarchical network has been proposed with new features to support the information infrastructure. However, the network hierarchy adds more complications to the network design and implementations and that hampers the network reliability and quality of services. Conformance testing is known to be a powerful tool for network fault detection yet most of the works in the published literature are on networks without hierarchy. We present probabilistic algorithms for testing hierarchical networks along with the added features. Based on a formal model of the networks, we provide a formal analysis that shows that our probabilistic algorithms guarantee a high fault coverage with a feasible number of tests. To further reduce the number of tests we identify test equivalence classes and that enables us to significantly reduce the number of tests yet without losing the fault coverage. Experimental results on Internet OSPF protocol are reported.

show abstract

An Approach for Testing Real Time Protocol Entities

Cited by 18 publications

References 15 publications

A Method for Testing the Conformance of Real Time Systems

A Method for Testing the Conformance of Real Time Systems

A test purpose‐based approach for testing timed input output automata

Fault Detection of Hierarchical Networks with Probabilistic Testing Algorithms

Contact Info

Product

Resources

About