Theoretical Computer Science
Generating test cases for real-time systems from logic specifications
ACM Transactions on Computer Systems (TOCS)
Diagnostic model-checking for real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Theoretical Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Timed Diagnostics for Reachability Properties
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Automatic Test Generation for the Analysis of a Real-Time System: Case Study
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Membership Questions for Timed and Hybrid Automata
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Timed Test Cases Generation Based on State Characterization Technique
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A test generation framework for quiescent real-time systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
| Hi-index | 0.01 |
Real-Time systems (RTS for short) are those systems whose behavior is time dependent. Reliability and safety are of paramount importance in designing and building RTS because a failure of an RTS puts the public and/or the environment at risk. For the purpose of effective error reporting and testing, this paper considers the trace inclusion problem for RTS: given a path ρ (resp. ρ′) of length n of a timed automaton A (resp. B), find whether the set of timed traces of ρ of length n are included in the set of timed traces of ρ′ of length n such that A is known but not B. We assume that the traces of ρ′ are only defined by a decision procedure. The proposed solution is based on the identification of a set of timed bound traces. The latter gives a finite representation of the trace space of a path. The number of these timed bounds varies between 1 and 2 × (n+1). The trace inclusion problem is then reduced to the inclusion of timed bound traces. The paper shows also how these results can be used to reduce the number of test cases for an RTS.