A practical and complete algorithm for testing real-time systems

Research output: Chapter in Book/Conference paperConference paperpeer-review

46 Citations (Scopus)

Abstract

This paper presents a formal method for generating conformance tests for real-time systems. Our algorithm is complete in that, under a test hypothesis, if the system being tested passes every test generated then the tested system is bisimilar to its specification. Because the test algorithm has exponential worst case complexity and finite state automata models of real-time systems are typically very large, a judicious choice of model is critical for the successful testing of real-time systems. Developing such a model and demonstrating its effectiveness are the main contributions of this paper.
Original languageEnglish
Title of host publicationFormal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998.
Subtitle of host publication Lecture Notes in Computer Science
EditorsA.P. Ravn, H. Rischel
Place of PublicationSpringer, Berlin, Heidelberg
Pages251-261
Volume1486
ISBN (Electronic)978-3-540-49792-9
DOIs
Publication statusPublished - 1998
Externally publishedYes

Fingerprint

Dive into the research topics of 'A practical and complete algorithm for testing real-time systems'. Together they form a unique fingerprint.

Cite this