Communication and concurrency
Theoretical Computer Science
Protocol testing: review of methods and relevance for software testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Selecting test sequences for partially-specified nondeterministic finite state machines
IWPTS '94 7th IFIP WG 6.1 international workshop on Protocol test systems
Testing deterministic implementations from nondeterministic FSM specifications
Selected proceedings of the IFIP TC6 9th international workshop on Testing of communicating systems
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Timed Wp-Method: Testing Real-Time Systems
IEEE Transactions on Software Engineering
Testing from a Nondeterministic Finite State Machine Using Adaptive State Counting
IEEE Transactions on Computers
EXPERIMENTAL EVALUATION OF FSM-BASED TESTING METHODS
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Studying the separability relation between finite state machines
Software Testing, Verification & Reliability
Formal testing from timed finite state machines
Computer Networks: The International Journal of Computer and Telecommunications Networking
Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-Outs
IEEE Transactions on Computers
Conformance tests as checking experiments for partial nondeterministic FSM
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Testing nondeterministic finite state machines with respect to the separability relation
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Testing Timed Finite State Machines with Guaranteed Fault Coverage
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Synthesis of distinguishing test cases for timed finite state machines
Programming and Computing Software
A practical approach for testing timed deterministic finite state machines with single clock
Science of Computer Programming
| Hi-index | 0.00 |
Conformance testing with the guaranteed fault coverage is based on distinguishing faulty system implementations from the corresponding system specification. We consider timed systems modeled by timed possibly non-deterministic finite state machines (TFSMs) and propose algorithms for distinguishing two TFSMs. In particular, we present a preset algorithm for separating two separable TFSMs and an adaptive algorithm for r -distinguishing two possibly non-separable TFSMs. The proposed techniques extend existing methods for untimed non-deterministic FSMs by dealing with the fact that unlike untimed FSMs in general, a TFSM has an infinite number of timed inputs. Correspondingly we state that the upper bounds on the length of distinguishing sequences are the same as for untimed FSMs.