Off-line test selection with test purposes for non-deterministic timed automata
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
A real-world benchmark model for testing concurrent real-time systems in the automotive domain
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Testing real-time systems under uncertainty
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Avoiding shared clocks in networks of timed automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Science of Computer Programming
Hi-index | 0.00 |
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA) which has internal actions, uncontrollable outputs and timing uncertainty of outputs. We define the partial observability of SUT using a set of predicates over the TGA state space, and specify the test purposes in Computation Tree Logic (CTL) formulas. A recently developed partially observable timed game solver is used to generate winning strategies, which are used as test cases. We propose a conformance testing framework, define a partial observation-based conformance relation, present the test execution algorithms, and prove the soundness and completeness of this test method (i.e., a detected error really violates the conformance relation; and if the SUT violates the test purpose, then a test case can be generated to detect this violation). Experiments on some non-trivial examples show that this method yields encouraging results.