Skip Navigation

The Computer Journal 2001 44(5):435-447; doi:10.1093/comjnl/44.5.435
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Koné, O.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Local Approach to the Testing of Real-time Systems

Ousmane Koné1

1 INPL, 2 Avenue de la Forêt de Haye, 54516 Vandoeuvre les Nancy, France Email: Ousmane.Kone@ensem.inpl-nancy.fr

Real-time systems are computer systems whose behaviour relies on physical time requirements. The violation of these requirements by some implementation may be uncomfortable (e.g. videoconferencing), or even catastrophic (e.g. process control), and thus damage the overall operation of the concerned systems. As more and more time-dependent products are becoming available on the market, the interest in testing them is growing, and standardization institutions (such as ISO/IEC) are working on the definition of formal description techniques for specifying real-time communication systems. But behaviour computation for real-time specifications generally involves exponential complexity. The work presented in this paper aims at avoiding this limitation in the test-development process. We use timed input–output automata to model systems behaviour. As implementations under test are ‘black-boxes’, the test verdict relies on the observation of behaviour that is inherent in some time intervals. These time intervals that characterize the success or the failure of a test experiment are computed in a local manner, from the synchronous product of a given specification and a given test requirement. An example with the ATM ABR protocol is provided to illustrate the work.


Received 22 June, 2000. Revised 6 April, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.