Theoretical Computer Science
Theoretical Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Verfying Invariance Properties of Timed Systems with Duration Variables
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Method for Testing the Conformance of Real Time Systems
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Verification of duration systems using an approximation approach
Journal of Computer Science and Technology
Timed Test Cases Generation Based on State Characterization Technique
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Test Case Generation Algorithm for Real-Time Systems
QSIC '04 Proceedings of the Quality Software, Fourth International Conference
FM'05 Proceedings of the 2005 international conference on Formal Methods
A formal framework for black-box conformance testing of distributed real-time systems
International Journal of Critical Computer-Based Systems
Hi-index | 0.00 |
We are interested in generating tests for duration systems modeling real-time systems. The specification of a duration system is given as a duration graph. Duration graphs are an extension of timed graphs and are suitable for modeling the accumulated times spent by computations within the considered duration system. In this paper, we present a method for generating tests for duration systems based on the so-called approximation method. First, we use the approximation method to extend the specification model into an approximate model. The latter contains the digitization computations of the initial model. Test trees are then extracted from the approximate model. We explain how the obtained digital-test trees can be executed in an analog-fashion.