Optimal length test sequence generation using distinguishing sequences
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science
Towards evaluating fault coverage of protocol test sequences
PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
Theoretical Computer Science
IEEE Transactions on Software Engineering
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
A Metric Based Theory of Test Selection and Coverage
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Fault Diagnosis for Timed Automata
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
Test Generation in the Presence of Conflicting Timers
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Test Generation for CEFSM Combining Specification and Fault Coverage
TestCom '02 Proceedings of the IFIP 14th International Conference on Testing Communicating Systems XIV
Fault Coverage in Testing Real-Time Systems
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Timed Test Cases Generation Based on State Characterization Technique
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
On the Fly Test Generation for Real Time Protocols
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
A technique to generate feasible tests for communications systems with multiple timers
IEEE/ACM Transactions on Networking (TON)
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models
IEEE Transactions on Computers
Algorithms for Modeling a Class of Single Timing Faults in Communication Protocols
IEEE Transactions on Computers
A guided method for testing timed input output automata
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Extending EFSMs to specify and test timed systems with action durations and timeouts
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Timing fault models for systems with multiple timers
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Applying formal methods to PCEP: an industrial case study from modeling to test generation
Software Testing, Verification & Reliability
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
Hi-index | 0.00 |
Detection of multiple timing faults is a challenging task because these faults, although may be detectable individually, can mask each other's faulty behavior, making a faulty implementation under test (IUT) indistinguishable from a non-faulty one during testing. This phenomenon, called fault masking, is formally defined in this paper. It is proven that graph augmentation algorithms proposed for timed Extended Finite State Machines (EFSMs) with multiple timers can detect pairwise occurrences of classes of timing faults in an IUT and, hence, detects fault masking.