Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Using On-The-Fly Verification Techniques for the Generation of test Suites
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Symbolic robustness analysis of timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FM'05 Proceedings of the 2005 international conference on Formal Methods
Test generation based on symbolic specifications
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
A test generation framework for quiescent real-time systems
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
Online testing of real-time systems using UPPAAL
FATES'04 Proceedings of the 4th international conference on Formal Approaches to Software Testing
An expressive and implementable formal framework for testing real-time systems
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
A symbolic framework for model-based testing
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Hybrid input-output conformance and test generation
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Testing real-time systems under uncertainty
FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Conformance testing for cyber-physical systems
ACM Transactions on Embedded Computing Systems (TECS)
A formal framework to test soft and hard deadlines in timed systems
Software Testing, Verification & Reliability
Science of Computer Programming
| Hi-index | 0.00 |
We investigate the problem of specification based testing with dense sets of inputs and outputs, in particular with imprecision as they might occur due to errors in measurements, numerical instability or noisy channels. Using quantitative transition systems to describe implementations and specifications, we introduce implementation relations that capture a notion of correctness "up to ε", allowing deviations of implementation from the specification of at most ε. These quantitative implementation relations are described as Hausdorff distances between certain sets of traces. They are conservative extensions of the well-known ioco relation. We develop an on-line and an off-line algorithm to generate test cases from a requirement specification, modeled as a quantitative transition system. Both algorithms are shown to be sound and complete with respect to the quantitative implementation relations introduced.